Three new recent discoveries. First, it turns out that you can generate a complete list of primes in the following fashion. Using %n% where %p + q = 2n%, let %n = 2% and find any Goldbach partitions %p, q%; if %max(q in bb Q)% is not in set %bb P%, add…

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…