Chapter 3 looked inside numbers for factors and ended with a master key, the prime fingerprint. Factors set the stage, divisibility tests gave quick eyes, primes were atoms, and GCD, LCM, and divisor counts all followed.
Key idea Factors and multiples are one relationship read from two ends. A factor of \(n\) is a side of a rectangle of area \(n\), so factors arrive in pairs that multiply to \(n\), \(d\) with its partner \(n \div d\). Turn the arrow around and the small number is a factor while the large one is a multiple. From this came several facts. A number has finitely many factors but infinitely many multiples, \(1\) divides everything, every number is both a factor and a multiple of itself, and \(0\) is a multiple of every number. And a number has an odd factor count exactly when it is a perfect square, the lone case where a factor pairs with itself.
Key idea Closure and chaining. Add or subtract two multiples of \(n\) and you land on a multiple of \(n\) again, since the shared \(n\) factors out, so a stray non-multiple can never be added onto a multiple to reach one. That is closure . And if \(a\) is a factor of \(b\), then every multiple of \(b\) is automatically a multiple of \(a\), since the multiple carries \(b\) inside it and \(b\) carries \(a\). That is chaining , and it runs only downward toward the smaller factors. These two ideas powered every divisibility test that followed.
With that structure in hand, the next question was practical. Must you divide a big number out the long way to know whether some small number goes into it, or can you glance at the digits and simply know? Place value gave the answer.
Key idea Divisibility tests all spring from place value. Cut a number where one chunk becomes a multiple of the divisor, let closure throw that chunk away, and judge the small piece left behind. The last digit settles \(2\), \(5\), \(10\), since every higher place is a multiple of ten. The last two digits settle \(4\) and the last three settle \(8\), since \(100 = 4 \times 25\) and \(1000 = 8 \times 125\). The digit sum settles \(9\) and \(3\), since every power of ten is one above a run of nines. The alternating digit sum settles \(11\), since the powers of ten bounce just below then above its multiples. Run any test backward and the same cut recovers a hidden digit.
Key idea Combine tests only along coprime factors. Split a composite divisor into coprime parts and test each. A split like \(12 = 2 \times 6\) fails because 2 and 6 share a factor, so passing both tests would count that shared factor twice while 12 demands it twice.
Testing for small factors led naturally to the smallest building blocks of all, the numbers that have no factors to find.
Key idea Primes are the atoms. A prime has exactly two divisors, a composite has more, 1 is neither, and 2 is the only even prime. To test primality, divide by primes up to \(\sqrt{n}\) and stop, any factor above \(\sqrt{n}\) has a smaller partner already checked.
Key idea Every number has one unique prime fingerprint (Fundamental Theorem of Arithmetic). Written with exponents like \(360 = 2^3 \times 3^2 \times 5\), it reveals: perfect square ↔ all exponents even, perfect cube ↔ all multiples of 3, trailing zeros = count of 2-and-5 pairs. Primes never run out.
Once a single number could be broken into its atoms, two numbers could be compared atom by atom, which opened the last ideas of the chapter.
Key idea GCD and LCM are two readings of two fingerprints. GCD takes each shared prime to its lower power. LCM takes every prime to its higher power. They satisfy \(\gcd\times\operatorname{lcm}=a\times b\). Numbers sharing no prime are coprime, and common multiples of a pair are multiples of their lcm.
Key idea The fingerprint counts divisors too. For \(n = p^a q^b \cdots\), the divisor count is \((a+1)(b+1)\cdots\). It depends on exponent shape, not size, so a smaller number can out-divide a larger one. The count is odd exactly for perfect squares.
The prime fingerprint settled divisibility, perfect powers, GCD, LCM, and divisor counts throughout the chapter. Chapter 4 turns to fractions, and these tools come straight along: GCD reduces fractions, LCM gives common denominators.
Learn it by doing it Reading is a start. In the course you solve each problem yourself, with instant feedback, layered hints, and Sprout right beside you when you get stuck. Free to start.
Open this lesson in the course →
QuanticaPrealgebraOpen in the course