How do you solve something like 7Xd =(congruent to) 1 mod 40?
find the smallest d that satisfies this equation
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
How do you solve something like 7Xd =(congruent to) 1 mod 40?
find the smallest d that satisfies this equation
Euler’s theorem suggests that if you raise 7 to a large enough power, you find D. Powers of seven mod 40 are 1, 7, 9, 23, 1, …, so d is 23.
D is unique as 40 and 7 are coprime (as 7 is prime). If it weren’t unique, there would be two d1, d2 such that d1 != d2 and d1*7 == 1 == d2*7 (mod 40), so some value (d2-d1)*7 mod 40 is zero. I’m not sure how a general case might be found.