How do you compute the following using Fermat’s Little Theorem?
2^1,000,006 mod 101
2^-1,000,005 mod 11
How do you compute the following using Fermat’s Little Theorem ? 2^1,000,006 mod 101
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 compute the following using Fermat’s Little Theorem?
2^1,000,006 mod 101
2^-1,000,005 mod 11
You know that a^(p-1) === 1 mod p, so…
2^10 === 1 mod 11
2^(-1,000,005) = 2^(-1,000,000)*2^(-5) = 1 * 2^(-5) = 2^(-5)*2^(10) = 32 mod 11 = -1 = 10
From this, can you see how to work the larger number? The process is the same.
It’s FLT all the way. I messed up.