Blog

I got nerd sniped by this first open problem described in a MathOverflow post by Richard Stanley, which suggests that there’s good reason to suspect that an innocuous-seeming combinatorial function might grows faster than any recursive function! This sounds right…

This post contains images based on the straightedge-and-compass constructions discussed in Part 1. Plotting points All the circles and lines Just for fun, here are two other images, the first shows all of the distinct lines and circles you can…

How many distinct constructions can be made with a straightedge and compass if we draw \(n\) lines and circles? Describing a straightedge-and-compass construction Initially we start with two points, which we call \((0,0)\) and \((1,0)\). At each step, we can…