Answer
7
Work Step by Step
By Fermat's little theorem, we can obtain that
7^{12} \equiv 1 (mod 13)
Hence,
7^{121} = (7^{12})^{10} * 7 \equiv 1 * 7 (mod 13) \equiv 7 (mod 13)
Discrete Mathematics and Its Applications, Seventh Edition
by Rosen, Kenneth
Published by
McGraw-Hill Education
ISBN 10:
0073383090
ISBN 13:
978-0-07338-309-5
Chapter 4 - Section 4.4 - Solving Congruences - Exercises - Page 285: 33
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.
