Saturday, 8 June 2013

elementary number theory - How to solve 13xequiv1 (textmod 17)?




How to solve 13x1 (mod 17)?




Please give me some ideas. Thank you.



Answer



You use the extended Euclidean algorithm as so:



17=113+4


13=34+1



Therefore



1=1334


1=133(17113)


1=413317

4131=317

x=4


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...