Find a $x$ such that $2^{2015}xequiv 1 pmod{13}$ [on hold]
up vote
-2
down vote
favorite
Since 13 is prime number using little Fermat's theorem $2^{12}equiv 1 pmod {13}$ then $2^{2015}equiv 2^{12cdot167+11}equiv 2^{11} pmod{13}$ then $2^{2015} x equiv 2^{11} x equiv 1 pmod{13}$ so then $xequiv 2$ , is this ok?
discrete-mathematics modular-arithmetic divisibility
share | cite | improve this question
edited yesterday
Bill Dubuque
206k 29 189 621
asked yesterday
Marko Škorić
581 10
...