the known values are x,y,a,b . we have to find p . p is a prime and ranges from 2 to 10^9 . I could not get any idea to solve . Even 30AC logic would be helpful . In return you will get CIRMERGE 100AC . If anyone happy to accept this offer DM me
> No more restrictions than 1 < p < 10e9?
p is prime
> Even 30AC logic would be helpful
¿what?
> In return you will get CIRMERGE 100AC
¿what? ¿can you eat that?
> I could not get any idea to solve
go to the definition of modulo
a = b mod m
that means that there exists an integer x such that
x*m + a = b
then you may solve for m
m = (b-a) / x