factor
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
show: "lattice"
show: "mersenne"
show: "aliquot"
show: "failure"
show: "grid"
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.
- 6 is called what it is ×7
- the bar for 6 is its divisors laid end to end ×7
- the lattice draws every divisor of 30 exactly once ×4
- 496 is perfect ×2
- the number is a whole number between 4 and 100000 ×2
- and so do the norms of two and three ×1
- between one and eight whole numbers above one ×1
- both first splits divide the number ×1
- both trees end in the same multiset of primes ×1
- every divisor including the number itself adds to twice the number ×1
- no divisor is drawn twice ×1
- no element of this ring has norm two or three, so neither factor can split further ×1
- the cells add up to the divisor sum ×1
- the divisor count is the product of one more than each exponent ×1
- the divisor sum factorises as the two row totals multiplied ×1
- the exponent is a whole number between 2 and 7 ×1
- the first tree's leaves multiply back to the number ×1
- the lattice half-width is a whole number between 2 and 5 ×1
- the Mersenne number for this exponent is prime ×1
- the number has a factor tree to draw ×1
- the number has at least three prime factors, so its trees can differ ×1
- the number has at most three distinct primes ×1
- the number is a product of exactly two prime powers ×1
- the powers of two below 2^k add up to the Mersenne number ×1
- the rectangle holds every divisor ×1
- the second tree's leaves multiply back to the number ×1
- the two conjugate factors have norms multiplying to 36 ×1
- the two trees start differently ×1
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 primes are what is left over
Eratosthenes' sieve does not find the primes. It removes everything else, one prime at a time, and whatever survives is prime by default — which is a strange way to reach the most studied objects in arithmetic.
NumberThere is no last prime
Euclid's argument is often described as producing a new prime from any finite list. It does not, and the number it builds is frequently composite — which makes the proof more interesting rather than less.
NumberNumbers that are their own parts
Six is one plus two plus three. Twenty-eight is one plus two plus four plus seven plus fourteen. Euclid explained where such numbers come from; Euler proved there are no others of that kind; and whether an odd one exists has been open for two thousand years.
NumberOne way to factor, and no other
Every number breaks into primes in exactly one way. That is so familiar it is hard to see as a claim at all — until it is put beside an arithmetic where it is false, and where six has two different factorisations that cannot be reconciled.
NumberThe shape of a number's divisors
Lay a number's divisors out as a lattice with one axis per prime, and two of the most useful facts in arithmetic stop being formulas and become the width and the corner of a rectangle.