Discrete Math Find a multiplicative inverse of 50 modulo 71.
Added by Pamela B.
Step 1
Step 2: Use the Extended Euclidean Algorithm to find the greatest common divisor (GCD) of 50 and 71, and also find integers x and y such that 50x + 71y = GCD(50, 71). Step 3: Since GCD(50, 71) = 1, we have 50x + 71y = 1. This means that 50x ≡ 1 (mod 71). Step Show more…
Show all steps
Close
Your feedback will help us improve your experience
Rosemary Charnley and 68 other Algebra 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
Use the Extended Euclidean Algorithm to find the mod 100 inverse of 53.
Nick J.
How many integers modulo 77 have inverses? How many integers modulo 81 have inverses?
Supreeta N.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD