top of page
History of Patterns among the Primes

Fred B. Holt
& Helgi Rudd

Fred began studying the cycles of gaps G(p#) in 1994.  This project went in-and-out of a desk drawer for several years.  From small cycles, like G(11#) or G(13#), he was able to outline preliminary results and first posted these to arXiv in 2007.  Helgi Rudd saw this paper and jumped in to extend the computations, to experiment with different visualizations, and to brainstorm about the patterns they were seeing.  Helgi generated the cycles of gaps up to G(37#) and produced counts of the populations of gaps and constellations in the cycles G(p#) and between primes over this range.  

​

One of the most important contributions that Helgi made was to ignore the upper bounds that Fred requested for certain computations.  Why stop at N when we can get the data for 10?  Helgi barreled through constraints that didn't really exist, freeing our imagination to expand our studies.

​

They collaborated on this project from late 2007 into 2015, when Helgi suddenly passed away.  Their paper Combinatorics of the gaps between primes summarizing their work-to-date would be presented at the Connections in Discrete Mathematics conference at Simon Frasier University in June 2015.

Dedication to Helgi Rudd

These studies benefitted greatly from Helgi's enthusiasm, curiosity, and computer skills.  He helped propel these studies forward.  The computational and theoretical aspects fed off each other, and together we were able to explore several questions about the patterns across these cycles G(p#).  

Book

Videos

Exercises

Papers

Useful Resources

Contact

bottom of page