One crossing, and then another: 1/5 of the square
n-division is one function. Everything below came out of it during this
build, at arguments 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 when the generator changes, this
page changes with it.
At its defaults
view: "table", upTo: 9, steps: 10
view: "by-hand", sigmaMM: 0.5, mm: 150
view: "decay", n: 9
What it checked while it drew
Collected by running this generator with a listener on the assertions, not written here. The count is how many separate times this build put that claim to the test.
- at 0.5 mm of placement error the convergent method's crease is the nearer one from 4 parts upward ×4
- the ladder reaches exactly 1/5 in 5 folds, checked as integers rather than to a tolerance ×4
- an error made early survives the ladder at 5 per cent of its size and Fujimoto's at 9e-8 per cent ×2
- and the halving method's error is never zero at any number of folds, which is the comparison ×1
- every rung from 2 to 9 lands on its fraction exactly ×1
Where it is called
Changing this generator changes every figure on this list, which is what makes the list worth publishing rather than keeping in a check script.
Cheap where it reaches
Two folds from a bare square put marks at a half, a third, a quarter, a fifth, a sixth, an eighth and a twelfth — and at no seventh, ninth or eleventh at all. A rule that reaches every fraction takes n folds to reach one nth. The systematic route and the short one disagree everywhere, and neither of them knows about the other.
Exact is not accurate
This site has two ways of dividing a strip into equal parts: a ladder that lands on the fraction as a rational number, and Fujimoto's method, which never arrives. Read as mathematics that settles it. Read as instructions for somebody with a sheet of paper it settles nothing, and past four parts the method that never arrives is the one whose crease lands nearer the mark.
One crossing, and then another
Folding a strip into thirds by Fujimoto's method halves the error at every fold and never reaches a third. There is a construction that arrives instead: cross the square's diagonal with a line through the mark you already have, and the crossing lands on the next fraction exactly — one fold per step, all the way down.
The grid a division makes
Dividing a square into thirds in both directions is a construction: four creases, each exact, each landing on a rational the ladder can name. The object it leaves behind is a three-by-three map of stamps, and how many ways that folds is the oldest open problem in the subject — 1,368 at three, 300,608 at four, and unknown at five.
The numbers a fold reaches
Folding solves cubics, which is one fact about one fold. The reason the subject has a theory rather than a bag of tricks is a second fact about all of them: the lengths a folder can mark are closed under addition, subtraction, multiplication, division, square roots and cube roots. Constructions can therefore be built out of constructions — and no tower of them ever arrives at a fifth root.
Every generator · The axioms and construction field · The patterns a reader can fold