Back الدالة المعدة للأعداد الأولية Arabic মৌলিক সংখ্যা গণনাকারী ফাংশন Bengali/Bangla Funció de recompte de nombres primers Catalan Prvočíselná funkce Czech Ffwythiant cyfri rhifau cysefin Welsh Primtalssætningen Danish Primzahlfunktion German Primo-kalkulanta funkcio Esperanto Función contador de números primos Spanish تابع شمارش اعداد اول Persian

Prime-counting function

"Π(x)" redirects here. For the variant of the gamma function, see Gamma function § Pi function.
This article uses technical mathematical notation for logarithms. All instances of log(x) without a subscript base should be interpreted as a natural logarithm, commonly notated as ln(x) or loge(x).

In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x.[1][2] It is denoted by π(x) (unrelated to the number π).

The values of π(n) for the first 60 positive integers
  1. ^ Bach, Eric; Shallit, Jeffrey (1996). Algorithmic Number Theory. MIT Press. volume 1 page 234 section 8.8. ISBN 0-262-02405-5.
  2. ^ Weisstein, Eric W. "Prime Counting Function". MathWorld.

Rich TVX News Network Site

Rich TVX News Network Info

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search