Number theory problems
Divisibility, remainders, gcd and short proofs with whole numbers.
Level 1: School
Level 2: Easy
- Last two digits of 7²⁰²⁶
- Trailing zeros of 100!
- Prove that √2 is irrational
- All Pythagorean triples: Euclid's formula
- The Collatz conjecture: 27 takes 111 steps
- How many divisors does 360 have?
- Why the digit sum tells you divisibility by 9
- The divisibility rule for 11
- Pigeonhole: six integers, two differ by a multiple of 5
Level 3: Medium
- Prove that 30 divides n⁵ − n
- Euclid: there are infinitely many primes
- Sun Tzu's puzzle: remainders 2, 3, 2
- Perfect numbers: 6, 28, 496, 8128
- Ramanujan's taxicab number 1729
- Euler's totient: how many numbers up to 100 are coprime to 100?
- The remainder of 3¹⁰⁰ divided by 7 (Fermat's little theorem)
- No number 4k + 3 is a sum of two squares