|Apr15-11, 04:05 AM||#1|
How many primes needed for the GOLDBACH CONJECTURE?
Out of the 664579 primes <10'000'000, just 10'545 selected prime numbers are needed to secure at least one Goldbach partition for any even number <10'000'000, less than 2%!
Considering all even numbers <10'000'000, the average count of Goldbach partitions amounts to 3'344 (per even number, using all primes <10'000'000), whereas, on the basis of the selected primes, the average count is just 6,93, less than 2/1000.
Article attached explains algorithm for selecting prime numbers.
|Similar Threads for: How many primes needed for the GOLDBACH CONJECTURE?|
|Goldbach's Conjecture (Theorem??)||Linear & Abstract Algebra||38|
|Goldbach’s Conjecture and the 2-Way Sieve||General Math||6|
|Goldbach's Conjecture||General Math||2|
|Question Regarding Goldbach's Conjecture||Linear & Abstract Algebra||20|
|Goldbach conjecture||Linear & Abstract Algebra||20|