Math Is Fun Forum

I am a prime number hobbyist! I am looking at patterns/formula for prime numbers. I do not ascribe to the notion that "prime numbers are "random" or even pseudo-random as I believe they are very much systematic due the fact that they are generated by elimination of the multiples of the lowest prime numbers (integers) on the integer number line progressively upwards, but essentially at a fixed increment of 1. I believe that it is also not essential to access big primes to generate a possible "formula" as the formula should work for all values, including the low prime numbers!!

I have developed two "algorithms" which I need to post somewhere where some math gurus could have a look if they make sense...but it might well be that others have already formulated such "algorithms". My first algorithm is essentially a variation of the Sieve of Eratostene and the other is a graphic function which returns a R^2 of 1 in Excel

I am not a serious mathematician, so I am not fluent in some of the deeper proofs and stuff, but I can follow the logic of the proofs in broad terms.

Is there anybody out there that might be interested in looking at my ideas?

Rgds