(adsbygoogle = window.adsbygoogle || []).push({}); Prime counting function-- no error.

I have developed a prime counting function with no error; it returns the exact number of primes equal to or less than any number one chooses.

I am rather ignorant of progress in this field... Has this been done before? Please, ignore any skepticism you might have about my claim; even if were somehow wrong, I would still like to know if such a function is already in existence.

(edit) Note: This function does not require any list of primes or knowledge of the "nth prime number". It does not utilize any functions that are not valid, known, and easily computable.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prime counting function- no error.

Loading...

Similar Threads for Prime counting function | Date |
---|---|

Counting function for powers of primes | Feb 15, 2012 |

Questions about the prime counting function | Feb 9, 2012 |

OBSERVATION: The #31, The Golden Scale, Prime Counting Function & Partition Numbers | Feb 4, 2011 |

Longest repeated sequence in the prime counting function | Jun 19, 2009 |

Expansion for the prime counting function | May 3, 2009 |

**Physics Forums - The Fusion of Science and Community**