6. Use properties of congruences to calculate $10^{6,000,000,000,000,000,000,000,000,000,000,000,000,000,002} \mod 13$? (the exponent has 43 digits).
Added by Catalina C.
Close
Step 1
Step 1: Since we are looking for the remainder when 10^(6,000,000,000,000,000,000,000,000,000,000,000,000,002) is divided by 13, we can use Euler's theorem which states that if a and n are coprime (which is the case for 10 and 13), then a^(phi(n)) ≡ 1 (mod n), Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 55 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Given that 3 is a primitive root of 43, find the following all positive integers less than 43 that have order 6 modulo 43, all other primitive roots of 43. Show theorems used and all work, please.
Sri K.
Use Fermat's little theorem to find 9^45 mod 23.
Diwakar M.
Use the Chinese Remainder Theorem to solve the following system of congruences: {x ≡ 2 (mod 5), x ≡ 3 (mod 6), x ≡ 4 (mod 7).
Shafiq R.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD