Deanmark
- 16
- 0
What are the last two digits of ${2017}^{82}$? We have only learned Fermat's little theorem and Euler's generalization so I am not sure how they apply?
The discussion revolves around finding the last two digits of ${2017}^{82}$, specifically exploring the application of Fermat's Little Theorem and Euler's Theorem in this context. Participants engage in mathematical reasoning related to modular arithmetic and the calculation of Euler's totient function.
Participants express differing views on the calculations and interpretations of modular equivalences, particularly regarding the use of $17$ and $-17$. The discussion remains unresolved as participants clarify and challenge each other's reasoning without reaching a consensus.
Participants note limitations in their understanding of number theory concepts, as the discussion is framed within the context of a Ring Theory class, which may restrict deeper exploration of the topic.
Deanmark said:What are the last two digits of ${2017}^{82}$? We have only learned Fermat's little theorem and Euler's generalization so I am not sure how they apply?
I like Serena said:Let's try to apply Euler's generalization.
To find the last two digits we need ${2017}^{82} \bmod 100$, so we have $n=100$.
How far can you get calculating Euler's totient function $\phi(100)$?
$\displaystyle \varphi(n) :=n \prod_{p\mid n} \left(1-\frac{1}{p}\right)$ and $100 = 2^25^2$ so $\displaystyle \varphi(100) =100 \prod_{p\mid 100} \left(1-\frac{1}{p}\right) = 100 \left(1-\frac{1}{2}\right) \left(1-\frac{1}{5}\right) = 40. $Deanmark said:I don't know anything about it. We only went of Fermat's and Euler's generalization of ax$\equiv$ b mod(m). The class is a Ring Theory class so we aren't really diving that deeply into the number theory.
June29 said:$\displaystyle \varphi(n) :=n \prod_{p\mid n} \left(1-\frac{1}{p}\right)$ and $100 = 2^25^2$ so $\displaystyle \varphi(100) =100 \prod_{p\mid 100} \left(1-\frac{1}{p}\right) = 100 \left(1-\frac{1}{2}\right) \left(1-\frac{1}{5}\right) = 40. $
Euler's Theorem: if $a$ and $n$ are coprime, then $\displaystyle a^{\varphi(n)} \equiv 1 \bmod{n}$ where $\varphi(n)$ is given by the above product.
Since $2017$ is relatively coprime to $100$, what does that tell you?
Could you explain what's happening here?Deanmark said:$ 2017^{2} - 1 \equiv 0 \ mod (100)$
June29 said:Could you explain what's happening here?
We have $2017^{2}\bmod{100} \equiv (17)^2\bmod{100} \equiv 289 \bmod{100} \equiv 89 \bmod{100}. $Deanmark said:A mistake.
It's just $2017^{2}$ mod(100) which you can find with a calculator, but if you did not have a calculator could we transform $2017^{2}$ mod(100) further.
June29 said:We have $2017^{2}\bmod{100} \equiv (-17)^2\bmod{100} \equiv 289 \bmod{100} \equiv 89 \bmod{100}. $
By definition if $a=b+km$ for $k \in \mathbb{Z}$ then $\displaystyle a \equiv b \bmod{m}$ (first and last step).
June29 said:We have $2017^{2}\bmod{100} \equiv (-17)^2\bmod{100} \equiv 289 \bmod{100} \equiv 89 \bmod{100}. $
By definition if $a=b+km$ for $k \in \mathbb{Z}$ then $\displaystyle a \equiv b \bmod{m}$ (first and last step).
Help me understand the objection here? 'Cause $17$ and $-17$ differ by $100$.kaliprasad said:No
We have $2017^{2}\bmod{100} \equiv (17)^2\bmod{100} \equiv 289 \bmod{100} \equiv 89 \bmod{100}. $and further last term 89 shall do
June29 said:Help me understand the objection here? 'Cause $17$ and $-17$ differ by $100$.
Oh, of course. It should be $\mathbf{+}17$. I've edited it now.I like Serena said:Nope. They differ by 34 (or 66 if we calculate the difference the other way round).
We do have $-17 \equiv 100 - 17 \equiv 83 \pmod{100}$.