How do I use Euler's theorem to evaluate (3^(1117^(8^25)) + 20210825) mod 163 ?
1 Answer
My understanding is that you wish to reduce $3^{1117^{8^{25}}}$ modulo $163$.
I have attempted a full written solution, but it will be long. I suggest adding a bounty for this as it is time-consuming.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
- 1 Answer
- 74 views
- Pro Bono
Related Questions
- bases and number representations Q
- Numbers Theory
- If both $n$ and $\sqrt{n^2+204n}$ are positive integers, find the maximum value of $𝑛$.
- Prove that one of $(n+1)$ numbers chosen from $\{1,2, \dots, 2n\}$ is divisible by another.
- Prove the following limits of a sequence of sets?
- Solve $abc=2(a-2)(b-2)(c-2)$ where $a,b $ and $c$ are integers
- The last six digits of the number $30001^{18} $
- Prove that $p^2-1$ is divisible by 24 for any prime number $p > 3$.
