Solve $x^{83}\equiv 7\pmod {139}$
Solve the congruence $x^{83}\equiv 7\pmod {139}$.
Please explain your working at each stage as if you were teaching an undergraduate student who were learning this for the first time! I am really trying to learn how to solve these type of. Qs. I notice that both the mod and exponent are prime. I suspect that you might need to use a primitive root, and would appreciate extra insights/explanations of alternative approaches or methods. Ideally, I would like to learn the most efficient methods possible.
Poincare
122
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
- accepted
- 191 views
- $50.00
Related Questions
- Why even/odd coordinates correspond to positive/negative signs in elliptic curves
- The last six digits of the number $30001^{18} $
- Wierdly Rational Fractions
- Quadratic residue
- bases and number representations Q
- Elementary num theory Q: or
- Solve $abc=2(a-2)(b-2)(c-2)$ where $a,b $ and $c$ are integers
- If both $n$ and $\sqrt{n^2+204n}$ are positive integers, find the maximum value of $𝑛$.
