# math

This is something I worked on a year ago, so I'll keep it (relatively) brief. Inspiration There's a keypad on my apartment building which accepts 5-digit codes. One day on the way in, I started thinking about how long it would take to guess a working code by brute force.

I've been trying to visualize the problem in many different ways, tables and graphs and geometry and anything else that seems plausible. Here's one I nailed down this morning that's concise and readily graspable for any coder. First, ignore the 2. It just gets in the way. And then we

I discovered a new (to me) way of approaching the Goldbach problem; this is a brief overview. Scratch page [ HTML | PDF ] Trying to prove there are always primes p, q such that p+q = N for any even N > 2, where p <= q. N.B. Largely ignoring 2