Monday, January 01, 2007
Prime research
My prime counting function research continues to be the hot area in terms of possible quick acceptance and easy accessibility.
Succinctly, back in 2002 I found a way to count prime numbers that relies on a prime counting function that is multi-variable. It is a recursive function so that it can just call itself allowing a stepping away from sieve methods to a partial difference equation.
I have a page that covers a lot of what I have on this subject on this group:
http://groups-beta.google.com/group/extrememathematics/web/counting-primes
Currently the paper on primes is under review at a peer reviewed journal.
Succinctly, back in 2002 I found a way to count prime numbers that relies on a prime counting function that is multi-variable. It is a recursive function so that it can just call itself allowing a stepping away from sieve methods to a partial difference equation.
I have a page that covers a lot of what I have on this subject on this group:
http://groups-beta.google.com/group/extrememathematics/web/counting-primes
Currently the paper on primes is under review at a peer reviewed journal.
# posted by James Harris @ 15:53 
