Jan 29, 2012 #1 smslca Member level 1 Joined Sep 9, 2007 Messages 33 Helped 0 Reputation 0 Reaction score 0 Trophy points 1,286 Activity points 1,656 If given a 'n' value and m = floor ( squareroot ) then is there any way to find the value of 'y' , such that ((m*y) mod n) is congruent to (n-1) ---------- Post added at 07:02 ---------- Previous post was at 05:38 ---------- with the help of a friend i figured out that, if m is the divisor of n, it wont be possible to get a solution . But what about the other values?
If given a 'n' value and m = floor ( squareroot ) then is there any way to find the value of 'y' , such that ((m*y) mod n) is congruent to (n-1) ---------- Post added at 07:02 ---------- Previous post was at 05:38 ---------- with the help of a friend i figured out that, if m is the divisor of n, it wont be possible to get a solution . But what about the other values?