How to solve and see resolution of $13^{53} \pmod 7$ using Fermat little Theorem? Using Fermat's Little Theorem, I know it gives me 6 as an answer to this problem..., but why? How is the resolution? Thanks,
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
migrated from mathematica.stackexchange.com Sep 25 '12 at 19:14
|
Fermat's Little Theorem says $x^7\equiv x\pmod{7}$. When $x\not\equiv0\pmod{7}$, we can divide by $x$ to get $$ x^6\equiv1\pmod{7} $$ In the case of $13^{53}$, we get that $13^{53}=13^{6\cdot8+5}=\left(13^6\right)^8\cdot13^5\equiv1^8\cdot(-1)^5\equiv-1\pmod{7}$ since $13^6\equiv1\pmod{7}$ and $13\equiv-1\pmod{7}$. Of course, since $13\equiv-1\pmod{7}$, we get that $13^{53}\equiv(-1)^{53}\equiv-1\pmod{7}$. In any case, $13^{53}\equiv-1\equiv6\pmod{7}$. |
|||||||||
|
Mathematicaprogramming ? Hint : for odd numbers it is always 6. – Artes Sep 25 '12 at 18:45Mod[13^53, 7]– belisarius Sep 25 '12 at 19:03