HackerWhen does a pattern in a picture become a proof?
A tiling suggests a conjecture, a new encoding turns rectangles into collisions, and a plotting rule creates spirals before primes even enter the picture. What work does each picture actually do?
Questions in this reading · 3
First try cases that might fail
Knuth notices an unexpected regularity in counts of rectangle pavings. More sizes agree. That is a good reason to investigate the pattern, and a poor stopping rule for establishing it. MIT’s proof lecture asks for deductions connecting explicit assumptions to the proposition. Give the conjecture to another reader and ask for a size most likely to break it. One counterexample disposes of a universal claim. A failed search leaves a precise question: which constraint rules out the cases nobody has tried?
Passages and timestamps · 2
all of a sudden you jump to a conjecture then you try it on it on another couple of casesis a verification of a proposition by a chain of logical deductions from a set of axioms.Which relationship must survive a change of picture?
Looking for an inscribed rectangle by dragging four points gives little guidance. Instead, encode each pair by its midpoint in the plane and its separation as height. A collision between distinct pairs yields equal diagonals that bisect each other. The encoding explains why a collision suffices; proving one must occur remains a separate job. Cube rotations and permutations supply another test. Counting 24 possibilities on either side is insufficient until the correspondence also respects successive actions.
Passages and timestamps · 3
the midpoint of A and C is the same as the midpoint of B and Dexactly d units above that midpoint mwhich preserves compositionDoes the spiral survive when every integer is plotted?
Plot n at radius n and angle n radians before filtering the primes. Forty-four steps nearly complete seven turns, so narrow arms appear even among all integers. Only after that control plot should one ask which missing points are due to primality. The lattice-circle problem takes a complementary route: estimate the count by area and count the same integer points by distance from the origin. One argument isolates an effect of plotting; the other identifies the common object counted along two routes.
Passages and timestamps · 3
taking 44 steps is very close to a whole number of turnshow many lattice points of the plane sit inside a big circlecount how many lattice points are on a given one of these ringsTry it on your own example
Choose a picture that recently persuaded you. Name its objects, its plotting rule and the step still needed to extend what you saw to cases outside the picture.