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.6K
-
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
- 619 views
- $30.00
Related Questions
- 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 $𝑛$.
- Advanced Modeling Scenario
- Elementary group theory and number theory questions involving prime numbers, permutation groups and dihedral groups. Introduction to number theory questions
- Solve $x^{83}\equiv 7\pmod {139}$
- Numbers Theory
- How many prime numbers (exact) less or equal to n, for one n, where n>=10^40?
- The last six digits of the number $30001^{18} $
