Math Is Fun Forum

I have found only complete list for 1-10^10

BTW some funny coincidence found by this theory. Pimes in range x-y are always in reverse order after given interval and the interval is always easy to compute for each primes group. So after you know Primes in range 1-10000000 you also know primes in 10000000-19999999 without computation.
So if I had 'big enough' calculator I could give you about 20 numbers where you could find prime with at least 100,000,000 decimal digits. I hope research will give more accurate result.
Also Im able to get <= number of primes for some ranges (which means there is never more than X primes in given range). I hope more research will give me exact number of primes in given range.

well every time sive works it's a proof that primes are not unpredictable, and waves are showing rules for that. but its ok, im rather not here to talk endlesly but to find someone who could help me somehow.

prediction for noise is not the prediction for next prime.
And you are right - I need bigger numbers, to draw conclusion for bigger numbers

according to the pdf - that every next free spot is a prime number, and this is exactly next prime. That will prove me that primes are not random, they have wave behavior and prime numbers 'noise' in given range can be always decoded and predicted endlesly.

Thats why I thought we missunderstood each other. Im not here to generate numbers but to check wave theory that will give a proof that primes are not in random positions.

I said that you need all primes X/2 to sieve X. Isnt this obivious?

We probably missunderstood each other. While you are checking if 997 is a prime, you just have to check if there is no interfere with primes in 2-500 range. Second half is irrelevant.

It looks like it works great in reversing. which is valuable in decyption of current cryptography. Also if you know how it works you can easily optimize sieve or (I hope) in future find a formula.

Im not saying its any kind of patern, but for example to find 19th-24th prime you just have to spin the whell of first 11. Larger numbers are, more (latest) you can easily exclude and still compute next primes corectly.

Also if its true you can predict how many bilion primes you need in sieve to find 10bilion digits prime (probably none) or 100bilon digits (also probably none).

@Agnishom: thx man its very refreshing to confront your ideas  with lager community.

Hehe yea, you are right. But it works perfectly for the first few primes, and my theory is defined - primes are like waves appearing in every new frequency hole, also genetaring his own. All that anyone else can do is to prove it wrong.

On range 1-200.000 there is this simple rule of 'how', 'when' and 'why'. Question is - if it's general rule for all primes.

yea, it's easiest I could find to search for them using script. I described script I've wroted to search not the theory. Theory is not about how to find prime.
The core is to show that primes are not appear randomly. There is the rule where and why they are in exact place in the numbers array. And also why 1 cannot be a prime number.

adding.
if you will find free spot, you just have to create new digit, lets say 11, and then 'occupy' every next number that is multiplication of 11 - 22,33,44,55,66,77,88 etc. Those spots are now 'occupied'.
Then you are going forward - number 12 - is 'occupied' by first prime - 2, so you are moving forward - 13 is free, so you create next prime and occupy every 13th number like 26, 39 etc.

Sounds silly, but its most basic description of non-free frequency I have found.

By adding all previous primes you are eliminating every number that is not a prime, and in final result you have list of primes.
Simple because you just have to add numbers endlesly and by adding you occuping not prime numbers. Each not occupied is prime (according to the theory, but require more computation).
Im game dev working in scripting language, so I can only generate 200k numbers array