Discrete Math: Divisibility, Primes & the Euclidean Algorithm
Divisibility rules, the division algorithm, primes and the sieve, prime factorization and divisor counts, gcd/lcm, extended Euclid and Bezout's identity.
means there is an integer k with (a divides b, a is a factor of b, b is a multiple of a). Note . Every integer divides 0; 1 divides every integer; 0 divides only 0.