Modulo Operation, Linear Combination and GCD (Proofs in Number Theory)

Learn the modulo operation, modular multiplication and the binary exponentiation algorithm with lots of examples. This book explains the concept of greatest common divisor (gcd) and describes, with examples, how to find the gcd using the Euclidean algorithm. It also proves that gcd distributes over lcm and lcm distributes over gcd. The topics treated include the following: Modulo operation Binary exponentiation algorithm Linear combination Euclidean algorithm Division relation GCD operation Relatively prime integers Bezout’s lemma GCD distributes over LCM LCM distributes over GCD