Saturday, May 29, 2004

This is exciting news. Richard Arenstorf of Vanderbilt submitted a paper claiming to a solution of the Twin Prime Conjecture. A few months ago I was working on web page with Twin Prime as the keywords. If I had finished it, I would be getting lots of web hits. Unfortunately, I got a call from someone wanting me to write a program that they had absolutely no intention of every using (grumble, grumble). Distracted, I never finished the article.

Anyway, the gist of what I was trying to do with the prime pattern article was to show that one of the easiest ways to process prime numbers is to record the primes with binary string. Using binary strings, it is easy to see a relation between the twin prime conjecture and Goldbach conjecture. The patterns also indicate that there are infinite twin primes.

I printed Professor Arenstorf's paper, and will see if I can add any of the ideas to the prime patterns article.

No comments: