Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Number Theory > Prime Numbers >
Mathematica > Mathematics and Algorithms > Mathematical Functions > Number Theoretic Functions > Prime Numbers >

RiemannR

RiemannR[x]
gives the Riemann prime counting function R(x).
  • Mathematical function, suitable for both symbolic and numerical manipulation.
  • For x>0, the Riemann prime counting function is given by R(x)=sum_n^inftymu(n) li(x^(1/n))/n.
  • RiemannR[z] has a branch cut discontinuity in the complex z plane running from -infty to 0.
  • RiemannR can be evaluated to arbitrary numerical precision.
  • RiemannR automatically threads over lists.
Evaluate for complex arguments:
Evaluate to high precision:
The precision of the output tracks the precision of the input:
Simple exact values are generated automatically:
RiemannR threads element-wise over lists:
TraditionalForm formatting:
The behavior of RiemannR near the origin:
The largest root of the Riemann prime counting function:
The second largest root:
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team