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 be viewed only if
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.
2 Attachments
Mathe
2.9K
-
Please disregard File #1, I wasn't done editing the document.
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
- answered
- 162 views
- $30.00
Related Questions
- Prove the following limits of a sequence of sets?
- Prove that one of $(n+1)$ numbers chosen from $\{1,2, \dots, 2n\}$ is divisible by another.
- bases and number representations Q
- If both $n$ and $\sqrt{n^2+204n}$ are positive integers, find the maximum value of $𝑛$.
- The last six digits of the number $30001^{18} $
- Solve $abc=2(a-2)(b-2)(c-2)$ where $a,b $ and $c$ are integers
- Numbers Theory
- Prove that $p^2-1$ is divisible by 24 for any prime number $p > 3$.
