Prime Count 2010
Prime Count - Introduction
What is Prime Count 2010?
In short,
It's a consolidated effort to automate
the calculation, numbering and cataloging
of all the primes toward infinity using an
algorithm based on Cook's 2nd Lemma
in his Riemann
Hypothesis Proof, coded in c++.
Why c++?
Because it is common for one and it's easy
to write wrappers for it in order to implement
other languages with it--or around it.
This effort could be named perhaps. Maybe
the Prime Count Coalition or Consordium
or even the Prime Count Club if you
will. In any case, the acronym will be PCC,
as opposed to CPP for c++.
Why even do this? Haven't lists of primes
been done to death since antiquity?
Prime numbers have been of interest
since antiquity, and while there are catalogs
of prime numbers already out there, there
is nothing as thorough and compact like what
this effort will entail, as will be explained
below.
This effort will be to simply develop a c++
application from multiple programmers and
run it on multiple computers. It will do its
part without any funds (at least to begin).
How the algorithm works
Before the algorithm is stated, it should
be mentioned that this calculation may not
be as fast in polynominal time as the AKS
method for primality testing, thus, P = NP
is not proven...yet. It is however, faster
than any other method besides this one with
the same accuracy, in fact, exponentially
faster. Hence, the first step after constructing
the core algorithm in c++ is to time it against
the others, to test it. If it turns out that
some other method is faster, then the cataloging
will involve those equations. Remember, this
is an algorithm to calculate to primes without
slowing using up a computer's memory, not
to test large primes.
The speed of this algorithm
The speed of the first one alone is exponentially
faster than simply checking divisibility of
all numbers up to s and faster to calculate
than the AKS method for smaller primes...but
then again so is the method of checking divisibility.
Thus, the entire program could implement other
methods in time to optimize the prime catalog.
Practical realities
* Arbitrary precision software will need
to be implemented, GMP is a good choice, as
it is fast and free
How to take part in the programming
Join the JeffreyNCook
newsgroup and discuss this there, as all
this will go on through that group. Esentially,
copy the code from the text file in the group
and make changes, testing in on your computer.
Once you've completed it, check-out the common
file. Your name will be credited in the code.
For more info, visit
the group.
How to join in the count
Simply download the exe and the currently
calculated primes in the text files and run
it on your computer, then submit the text
files with your newly calculated primes to
the group.
The initial buggy code
Download the textfile
Or...
The initial buggy code
in c++
So, again, feel free to join
in with primeCount 2010 and help
this project along!
|
