Browse Groups

• ## References for this recursive def. of Riemann prime counting function?

(1)
• NextPrevious
• Hey all. Can anyone point to any references or discussion of this recursive definition (or trivial variants) of the Riemann prime counting function*? In
Message 1 of 1 , Jul 15
View Source
Hey all. Can anyone point to any references or discussion of this recursive definition (or trivial variants) of the Riemann prime counting function*? In Mathematica syntax it's

P[n_,k_,j_]:=1/k - P[n/j,k+1,Floor[n/j]] + P[n,k,j-1]
P[n_,k_,1]:=0

With this, P[n, 1, n] computes the Riemann prime counting function. So N[P[100,1,100]] is 28.5333..., for example. Or DiscretePlot[P[n,1,n],{n,2,100}] is the familiar graph of prime powers up to 100.

Thanks.

* http://mathworld.wolfram.com/RiemannPrimeCountingFunction.html
Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.