Primorial sieve

Bachelor and Master students may find thesis subjects based on the information on this website, see also the examples in  prime number projects.pdf.

My project started in  2008  by placing a prime number on the  short side  of  a primitive Pythagorean triangle. In  2012  the outlines of the  (double) primorial sieve  came to life.
The preliminary results of the  (double) primorial sieve  offered the opening for solving the  Ulam spiral  conundrum.
The mystery of the  Ulam spiral (1963)  was unraveled at the end of  2013  by the discovery of the  eight  families of functions that capture all natural numbers, see the unraveling of the Ulam spiral.pdf.

The primorial sieve is a new algorithm in mathematics to distinguish prime numbers. The primorial sieve can be used to find all prime numbers up to a specific integer value and has advantages over the solid Sieve of Eratosthenes.

The primorial sieve can also be used as a double sieve within a specific range of (very) large integers.
Its basic function mimics Pritchard's Wheel Factorization (1982), with the primorial sieve beeing more sophisticated.
The results of  the  (double) primorial sieve  supply a possible explanation for the  (9, 1)  last digit preverence of prime numbers, see  the (double) primorial sieve.pdf.

Ing. J.I.M. (Hans) Dicker MEd.
The Netherlands

Back.