Generator

factor

A generator in the number library, called 19 times across 5 essays. Below: what it draws at its defaults and at each mode an essay asks for, what it checks while drawing, and everywhere it is used.

factor is one function. Everything below came out of it during this build, at parameters taken from the essays rather than invented for this page — so a figure here is the same figure a reader meets in an essay, and if the generator changes, this page changes with it.

At its defaults

Two factor trees of 360The same number split two different ways, both ending in the same primes.first split 2 × 180first split 18 × 203602180229022245222315222335360182029210233225both end in 2 × 2 × 2 × 3 × 3 × 5the same primes, the same number of times, in a different order — and that is the theorem

show: "lattice"

The divisors of 30Every divisor as a lattice point, one axis per prime, joined when one divides the other by a single prime.12365101530× 2 →× 3 ↑2 × 3 × 5 — 2 × 2 × 2 = 8 divisors

show: "mersenne"

496 is perfect, because its divisors form this rectangleTwo rows of divisors: the powers of two, and the same powers multiplied by the Mersenne prime.2^4 × (2^5 − 1) = 16 × 31 = 4961248163162124248496× 1× 31= 31= 961the whole rectangle adds to 31 × (1 + 31) = 992which is twice 496, so the divisors below 496 add to 496 exactly

show: "aliquot"

Proper divisors, added upFor each number, its proper divisors laid end to end against the number itself.6the number itself236 — perfect12the number itself234616 — abundant16the number itself24815 — deficient28the number itself2471428 — perfect30the number itself2356101542 — abundantthe top bar of each pair is the divisors; the bottom is the number they came from

show: "failure"

Six, factored two waysThe lattice of numbers a + b√−5, each point labelled with its norm a² + 5b².5449464546495429242120212429149656914941014914965691429242120212429544946454649546 = 2 × 3 = (1 + √−5)(1 − √−5)the marked points are the four factors — norms 4, 9, 6 and 6, multiplying to 36 either wayand no point anywhere on this lattice has norm 2 or 3, so none of the four can be split

show: "grid"

The divisors of 72 as a rectanglePowers of one prime across, powers of the other down; every divisor appears once.91836723612241248122^22^3133^2= 15= 45= 1354 × 3 = 12 divisors, adding to 195and 195 = 15 × 13 — the row totals, which is why the divisor sum is multiplicative

What it checks while it draws

Collected by running the family and listening to lib/verify.js, not written here. The count is how many separate times this build put that claim to the test.

Where it is called

Changing this generator changes every figure on this list. That is what makes the list worth publishing rather than keeping in a check script.

The whole library · What the figures prove