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
- 506 views
- Pro Bono
Related Questions
- Elementary group theory and number theory questions involving prime numbers, permutation groups and dihedral groups. Introduction to number theory questions
- Prove that $p^2-1$ is divisible by 24 for any prime number $p > 3$.
- How many prime numbers (exact) less or equal to n, for one n, where n>=10^40?
- Solve $x^{83}\equiv 7\pmod {139}$
- Why even/odd coordinates correspond to positive/negative signs in elliptic curves
- Advanced Modeling Scenario
- Why is the distribution of primes considered mysterious or unpredictable?
- The last six digits of the number $30001^{18} $
