Proposition: Congruence Modulo a Divisor
Let $a,b$ be integers and $n > 0, m > 0$ be positive integers with $m\mid n,$ i.e. $m$ being a divisor of $n.$ Then
$$\begin{array}{c}a(n)\equiv b(n)\\
\Longrightarrow\\
(a)(m)\equiv(b)(m).
\end{array}$$
Table of Contents
Proofs: 1
Mentioned in:
Proofs: 1 2 3 4 5
Thank you to the contributors under CC BY-SA 4.0! 
- Github:
-
References
Bibliography
- Landau, Edmund: "Vorlesungen über Zahlentheorie, Aus der Elementaren Zahlentheorie", S. Hirzel, Leipzig, 1927
- Jones G., Jones M.: "Elementary Number Theory (Undergraduate Series)", Springer, 1998
