(i) Use the Euclidean Algorithm to compute gcd(2,11), and then express gcd(2,11) as a linear combination of 2 and 11. (ii) Hence, find the inverse of 2 modulo 11 (iii) Hence, solve the linear congruence 2x ? 9 mod 11
Added by Mark V.
Close
Step 1
Step 1: Compute gcd(2, 11) using the Euclidean Algorithm: 11 = 2 * 5 + 1 2 = 1 * 2 + 0 Therefore, gcd(2, 11) = 1. Show more…
Show all steps
Your feedback will help us improve your experience
Suman K and 58 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
Compute congruences and perform arithmetic modulo n. If a ≡ 3 (mod 11) and b ≡ 9 (mod 11): (a) Compute a - b (mod 11) (b) Compute b^2 (mod 11)
Amanda C.
Adi S.
Show that 937 is an inverse of 13 modulo 2436
Number Theory and Cryptography
Solving Congruences
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD