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.
Sameljk
42
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- 1 Answer
- 487 views
- Pro Bono
Related Questions
- Elementary num theory Q: or
- Numbers Theory
- Prove that $p^2-1$ is divisible by 24 for any prime number $p > 3$.
- If both $n$ and $\sqrt{n^2+204n}$ are positive integers, find the maximum value of $𝑛$.
- How many prime numbers (exact) less or equal to n, for one n, where n>=10^40?
- Prime gap pattern in these plots?
- 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?
