- #1
Carl A Bohn
- 3
- 0
I was reading an old thread about multiplying successive prime numbers adding 1 to obtain another prime number.
I have worked with prime numbers for several years now and have developed what I best call a bi-linear advancement. It is an open-ended sieve of Eratosthenes. After many, many hours across the years, I have finally developed a piece of code that locates prime numbers. I built it on a small laptop in QB6, and so far it is locating primes out in the 4.9 billion range. (Time elapsed: 18 hours.)
Actually, I am locating all the prime-subs. From there, I am able to extract all the intervening prime numbers.
The one key issue I had to deal with is the prime numbers 2,3, and 5. I found a way to extract those multiples from the process, then discovered a rather unique way of grouping prime numbers. The rest of it is just plain math. But, I took it a step further a developed a system of linear tables that reduces the whole process down to a lookup table. I also have a very unique way to store prime numbers in a very condensed form.
I have worked with prime numbers for several years now and have developed what I best call a bi-linear advancement. It is an open-ended sieve of Eratosthenes. After many, many hours across the years, I have finally developed a piece of code that locates prime numbers. I built it on a small laptop in QB6, and so far it is locating primes out in the 4.9 billion range. (Time elapsed: 18 hours.)
Actually, I am locating all the prime-subs. From there, I am able to extract all the intervening prime numbers.
The one key issue I had to deal with is the prime numbers 2,3, and 5. I found a way to extract those multiples from the process, then discovered a rather unique way of grouping prime numbers. The rest of it is just plain math. But, I took it a step further a developed a system of linear tables that reduces the whole process down to a lookup table. I also have a very unique way to store prime numbers in a very condensed form.