(a) Given 5x ? 7(mod 8), find the inverse of 5 modulo 8, then find x. (b) Find the gcd of 1785 and 546 using the Euclidean algorithm.
Added by Jeffrey J.
Close
Step 1
Step 1: To find the inverse of 5 modulo 8, we need to solve the equation 5x ≡ 1 (mod 8). Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 78 other Calculus 3 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
6. Use the Euclidean algorithm to find gcd (123, 277). 7. Find an inverse of 34 modulo 89? 8. Solve the congruences using the modular inverses found in question 4 of 34x ≡ 77 mod 89. 9. Use the construction in the proof of the Chinese remainder theorem to find a solution to the system of congruences x ≡ 1 mod 2 x ≡ 2 mod 3 x ≡ 3 mod 5 x ≡ 4 mod 11 10. Use Fermats little theorem to find 7^{712} mod 13.
Sri K.
Solve the following congruences (you may use technology to run the extended Euclidean Algorithm/find inverse): i. 313x ≡ 12345 (mod 54321) ii. 42x ≡ 30 (mod 939) iii. 85x ≡ 285 (mod 697)
Let d = gcd(2452548, 2943234). By means of the Extended Euclidean Algorithm, find d and find all integers x, y that solve d = 2452548x + 2943234y.
Madhur L.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD
