If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)

Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

Hi there,
There is an issue with role permissions that is being worked on at the moment.
If you are having trouble with access or permissions on regional forums please post here to get access: https://www.boards.ie/discussion/2058365403/you-do-not-have-permission-for-that#latest

((my) mod n ) congruent to n-1

smslca · 2012-01-29 04:44:48

If given a 'n' value and m = floor ( squareroot(n) ) then is there any way to find the value of 'y' , such that ((m*y) mod n) is congruent to (n-1)

29-01-2012 4:44am

#1

smslca

Registered Users, Registered Users 2 Posts: 28 ✭

Join Date: December 2007

Posts: 13

If given a 'n' value and m = floor ( squareroot(n) )
then is there any way to find the value of 'y' , such that

((m*y) mod n) is congruent to (n-1)

0

Comments

#2 29-01-2012 6:02am

smslca

Registered Users, Registered Users 2 Posts: 28 ✭

Join Date: December 2007

Posts: 13

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?

0