Skip to main content

Modular Arithmetic

  1. Proof: a natural number n is a prime if b^(n−1) = 1 (mod n) for every integer b between 1 and n-1
  2. A number is divisible by 3 iff sum of its digits are divisible by 3

See all tags.