• prime number theorem
○ Around 300 BC Euclid proved there were infinite number of prime numbers. ○ The number of prime numbers less than a certain natural number is asymptotically equivalent to x/(x⍻e).
http://qindex.info/i.php?x=3779

• prime number theorem
○ π(n) is asymptotically equivalent to x/log x. ○ Of the first n integers, roughly 1/log n of them would be prime. #math
http://qindex.info/i.php?x=9583

Google ➔ Dictionary ➔ Image ➔ YouGlish