Counting function for powers of primes

  1. removed
    Last edited: Feb 15, 2012
  2. jcsd
  3. at this point it is more important for you to show that your method works. I suggest you write a program and test your method using the formulas you posted. If the test works for large numbers, then you have something serious. By the way, this problem is an open problem in number theory so you may just have come up with a solution.
  4. "Method" is correct and works, in the sense that it will give correct numbers in general. Unfortunately you will not be able to condense your expressions significantly. You would then, among other things, likely need a formula for the nth prime, and btw the exact same set up of inclusion/exclusion and floors can be used to express the prime counting function, for which there is very likely no short and elementary formula.
  5. Sorry to see you remove this. Was Interesting.
Know someone interested in this topic? Share this thead via email, Google+, Twitter, or Facebook

Have something to add?