- #1
coolul007
Gold Member
- 271
- 8
I am wondering if there is a way to solve the following:
n == a mod(m)
m == b mod(r)
n == x mod(r), I need to know x, without dealing with a gigantic number(n),
I can find a and b, as I chose m to give me predictable results.
I appreciate any insight...
n == a mod(m)
m == b mod(r)
n == x mod(r), I need to know x, without dealing with a gigantic number(n),
I can find a and b, as I chose m to give me predictable results.
I appreciate any insight...