A simple code was created to generate primes using the above method. The code can generate all the primes where the limit becomes the largest integer able to be stored, our limit \(long \; long \;unsigned \; int\). This code will be diplayed below.
To check the primality of any single number \(N\) one can evaluate \(\Delta\theta_N(1)\), if this quantity is equal to \(2\) then the number is prime. The information required is then \(\theta_N\) and \(\theta_{N-1}\).
Another simple code to check the primality of any number was made and will be diplayed below.