Solution to Find the inverse of 35 modulo 11 by using extended Euclidean Algorithm step by step … - Sikademy
Author Image

Archangel Macsika

Find the inverse of 35 modulo 11 by using extended Euclidean Algorithm step by step solution

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

35=3\times11+2...(1)\\ 11=5\times2+1...(2)\\ 2=2\times1+0\\

Now,

1=11-5\times2\ \text{From (2)}\\ 1= 11-5\times (35-3\times11) \ \text{From (1)}\\ 1= 11-5\times35+15\times11\\ 1=-5\times35+16\times11\\ 1(\text{mod 11})=6\times35+16\times11\\ 1(\text{mod 11})=6\times35

6\equiv 35^{-1} \text{mod 11}

Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-1122-qpid-860