GCD (Greatest Common Divisor): largest number dividing both. LCM × GCD = a × b
Divisibility rules: ÷2 (even), ÷3 (digit sum ÷3), ÷4 (last 2 digits ÷4), ÷5 (ends 0,5), ÷9 (digit sum ÷9)
Prime factorization: express as product of primes. Number of divisors = (e₁+1)(e₂+1)…
LCM(a,b) = (a × b) / GCD(a,b)
Sum of 1 to n = n(n+1)/2
Sum of odd integers 1 to (2n-1) = n²
Example
How many positive divisors does 36 have?
36 = 2² × 3² → divisors = (2+1)(2+1) = 9
Answer: 9 divisors (1,2,3,4,6,9,12,18,36)