φ(n) counts integers ≤ n coprime to n. Primes give φ(p) = p−1. The ratio φ(n)/n → 0 for highly composite numbers. Upper envelope = n−1 (primes); lower structure reveals prime powers.