Difference between revisions of "2021 WSMO Accuracy Round Problems/Problem 7"
Line 12: | Line 12: | ||
\end{align*}</cmath> | \end{align*}</cmath> | ||
Thus, | Thus, | ||
− | <cmath> | + | <cmath>\begin{align*} |
− | \begin{align*} | ||
2^n+3^n\equiv&\text{ }5\pmod{10}\tag{for n\equiv1,3\pmod{4}}\\ | 2^n+3^n\equiv&\text{ }5\pmod{10}\tag{for n\equiv1,3\pmod{4}}\\ | ||
2^n+3^n\equiv&\text{ }3\pmod{10}\tag{for n\equiv2\pmod{4}}\\ | 2^n+3^n\equiv&\text{ }3\pmod{10}\tag{for n\equiv2\pmod{4}}\\ |
Revision as of 10:22, 11 July 2022
Problem
Find the value of where is the remainder when is divided by 10.
Solution 1
From Fermat's Little Theorem, we find that is periodic in cycles of 4. This means that for all Now, we will compute the first 4 values of Thus,
\begin{align*} 2^n+3^n\equiv&\text{ }5\pmod{10}\tag{for n\equiv1,3\pmod{4}}\\ 2^n+3^n\equiv&\text{ }3\pmod{10}\tag{for n\equiv2\pmod{4}}\\ 2^n+3^n\equiv&\text{ }7\pmod{10}\tag{for n\equiv0\pmod{4}}\\ \end{align*} (Error compiling LaTeX. Unknown error_msg)
This means that ~pinkpig
Solution 2
We will begin by examining and :
and
From this, we can note that:
We can simplify our sum as follows:
Note that :
~BigKahuna227