This unit covers aspects of number theory that are useful in programming contests and lead to interesting algorithms:
- Prime numbers and prime check
- Sieve of Eratosthenes (and variants)
- Greatest Common Divisor and Least Common Multiple
- Extended Euclid's algorithm
- Primary school level arithmetics
- Unit 1: Complexity
- UVa 543 - Goldbach's Conjecture (sieve)
- UVa 583 - Prime factors (sieve + factorization)
- UVa 11827 - Maximum GCD
- UVa 10104 - Euclid Problem (extended Euclid)
- UVa 11752 - The Super Powers
- UVa 294 - Divisors
- UVa 10407 - Simple division
- UVa 10892 - LCM Cardinality