Elementary num theory Q: or
Suppose for $k\in\Z$, $m,n\in\Z^+$, $\gcd(k,n)=\gcd(k,m)=\gcd(m,n)=1$, where $k$ has the orders of 5 modulo m, and 7 modulo n$. Find the order of k modulo mn and justify your solution.
Answer
Answers can only be viewed under the following conditions:
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
2 Attachments
Mathe
3.7K
-
Please disregard File #1, I wasn't done editing the document.
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 997 views
- $30.00
Related Questions
- Wierdly Rational Fractions
- Why is the distribution of primes considered mysterious or unpredictable?
- 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?
- Prove that one of $(n+1)$ numbers chosen from $\{1,2, \dots, 2n\}$ is divisible by another.
- Solve $abc=2(a-2)(b-2)(c-2)$ where $a,b $ and $c$ are integers
- Quadratic residue
- Solve $x^{83}\equiv 7\pmod {139}$
