![Modular (Remainder) Arithmetic n = qk + r (for some k; r < k) eg 37 = (2)(17) + 3 Divisibility notation: 17 | n mod k = r 37 mod 17 = ppt download Modular (Remainder) Arithmetic n = qk + r (for some k; r < k) eg 37 = (2)(17) + 3 Divisibility notation: 17 | n mod k = r 37 mod 17 = ppt download](https://images.slideplayer.com/26/8780672/slides/slide_11.jpg)
Modular (Remainder) Arithmetic n = qk + r (for some k; r < k) eg 37 = (2)(17) + 3 Divisibility notation: 17 | n mod k = r 37 mod 17 = ppt download
![elementary number theory - Given that a and b are integers, a ≡ 4 (mod 13), and b ≡ 9 (mod 13). Find c where c ≡ 9a (mod 13). - Mathematics Stack Exchange elementary number theory - Given that a and b are integers, a ≡ 4 (mod 13), and b ≡ 9 (mod 13). Find c where c ≡ 9a (mod 13). - Mathematics Stack Exchange](https://i.stack.imgur.com/k6Lke.png)
elementary number theory - Given that a and b are integers, a ≡ 4 (mod 13), and b ≡ 9 (mod 13). Find c where c ≡ 9a (mod 13). - Mathematics Stack Exchange
![elementary number theory - Congruent iff Same Remainder (CISR) Confusion - Mathematics Stack Exchange elementary number theory - Congruent iff Same Remainder (CISR) Confusion - Mathematics Stack Exchange](https://i.stack.imgur.com/c2ecn.png)