Modular arithmetic : Distributive
16548
Prove $(x+y) \text{ mod } n = ((x \text{ mod } n)+(y \text{ mod } n)) \text{ mod } n,\,$ and product analog
1425
The Chinese Remainder Theorem for Rings.
68252
Chinese Remainder Theorem solvability for non-coprime moduli
10966
gcd and lcm from prime factorization proof
39969
Algorithms for computing multiplicative order modulo $n$
21476
Modular Exponentiation 3^5^7
360
Modular exponentiation by hand ($a^b\bmod c$)
19071
solution set for congruence $x^2 \equiv 1 \mod m$
5577
If $m$ divides $n$, find a free resolution of $\mathbb{Z}/m$ as a $\mathbb{Z}/n$-module.
18634
Combinations of sets raised to the power of a prime modulus: $\binom{p^{\alpha}-1}k \equiv (-1)^k \pmod p$
127816
Number theory proof mod p
26330
Why can we modular reduce arguments of sums and products in modular arithmetic?
22029
Solving modular arithmetic questions
72295
A difficulty in understanding the proof of distributivity of tensor products over direct sums for modules.
36713
Solving multiple congruences by CRT = Chinese Remainder Theorem
109490
Modular arithmetic problem (mod $13$)
107349
Working with elementary type proofs of divisor functions