Congruence (Number Theory)/Examples/365 congruent to 1 Modulo 7
Jump to navigation
Jump to search
Example of Congruence Modulo an Integer
- $365 \equiv 1 \pmod 7$
Proof
| \(\ds 365\) | \(=\) | \(\ds 52 \times 7 + 1\) | ||||||||||||
| \(\ds \leadsto \ \ \) | \(\ds 365\) | \(\equiv\) | \(\ds 1\) | \(\ds \pmod 7\) |
$\blacksquare$
Sources
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): congruence modulo $n$
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): congruence modulo $n$