Question
Find the inverse of 13 (mod 51) using extended euclidean algorithm.
Answer :
Word Count : 291
____ __________ _________ _________ ________ ___ __________ __________.
________ _______ ____ _______ _________ _________ _______ _____ _____ _____ _______ _____.
_________ ______ _______ ___ ______.
________ _________ ______ __________ _________ ___ ________ ___ ________.
______ _________ __________ _______ _________ _______ ______ _____ ________ _______.
________ ______ ____ _____ ___ ________ _______ ____ ________ _____ _________ ____.
_____ ___ ________ __________ _____.
_________ _______ ______ ___ ___ ___.
_________ ______ __________ ________ ________ ______ ________ _____ __________ __________ ______ ___.
________ __________ ______ ___ ____ _________ ______ ______ _________ __________.
________ ________ _______ ___ ______ ____ ________ _____ __________ ________ _______ __________.
_______ ____ ______ __________ ________ _________ _____ ________.
________ __________ ___ _________ _________ _________ ___ _____ __________ ______ ____.
____ ________ ______ _________ _________ __________ _______ ____ _______ ______ __________.
_______ ___ ___ _________ ______.
_____ _________ ________ ______ _________ _____ ____.
____ _______ _______ ___ ________ _______.
_______ ___ ___ ________ ______ ______ ___ _________ __________.
___ ____ ________ ______ _________ _________ ____.
___ __________ ___ _____ ____.
______ ______ _____ _____ __________.
______ _______ __________ _______ _________.
Skip in 10
To find the inverse of 13 modulo 51 using the Extended Euclidean Algorithm, we need to solve for \( x \) in the equation:
\[
13x \equiv 1 \mod 51
\]
This is equivalent to finding \( x \) such that \( 13x - 51k = 1 \), where \( k \) is an integer. We can apply the Extended Euclidean Algorithm to solve this.
### Step 1: Apply the Euclidean Algorithm
First, apply the Euclidean algorithm to find the greatest common divisor (GCD) of 13 and 51:
\[
51 = 3 \times 13 + 12
\]
\[
13 = 1 \times 12 +
________ _______ ____ _______ _________ _________ _______ _____ _____ _____ _______ _____.
_________ ______ _______ ___ ______.
________ _________ ______ __________ _________ ___ ________ ___ ________.
______ _________ __________ _______ _________ _______ ______ _____ ________ _______.
________ ______ ____ _____ ___ ________ _______ ____ ________ _____ _________ ____.
_____ ___ ________ __________ _____.
_________ _______ ______ ___ ___ ___.
_________ ______ __________ ________ ________ ______ ________ _____ __________ __________ ______ ___.
________ __________ ______ ___ ____ _________ ______ ______ _________ __________.
________ ________ _______ ___ ______ ____ ________ _____ __________ ________ _______ __________.
_______ ____ ______ __________ ________ _________ _____ ________.
________ __________ ___ _________ _________ _________ ___ _____ __________ ______ ____.
____ ________ ______ _________ _________ __________ _______ ____ _______ ______ __________.
_______ ___ ___ _________ ______.
_____ _________ ________ ______ _________ _____ ____.
____ _______ _______ ___ ________ _______.
_______ ___ ___ ________ ______ ______ ___ _________ __________.
___ ____ ________ ______ _________ _________ ____.
___ __________ ___ _____ ____.
______ ______ _____ _____ __________.
______ _______ __________ _______ _________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.