wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Using the extended euclidean algorithm, find the multiplicative inverse of 12in Z26


Open in App
Solution

According to the Extended Euclidean Algorithm

The multiplicative inverse of an integer bin Znwill exist only if GCD(n,b)=1

Heren=26 andb=12. ClearlyGCD(26,12)1

Therefore multiplicative inverse of 12does not exist in Z26


flag
Suggest Corrections
thumbs-up
2
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Logical Connectives
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon