Complete study notes: integer arithmetic (Euclidean division, primes, gcd/lcm), Diophantine equations (Euclid's algorithm, Bézout), modular arithmetic (congruences, Euler's function, Euler–Fermat, inverses, CRT) and RSA. Includes proofs, step-by-step work