# prime number theorem

noun, Mathematics
1.
the theorem that the number of prime numbers less than or equal to a given number is approximately equal to the given number divided by its natural logarithm.
Origin of prime number theorem
1660-1670
1660-70
Dictionary.com Unabridged
Based on the Random House Dictionary, © Random House, Inc. 2015.
Cite This Source
prime number theorem in Technology

mathematics
The number of prime numbers less than x is about x/log(x). Here "is about" means that the ratio of the two things tends to 1 as x tends to infinity. This was first conjectured by Gauss in the early 19th century, and was proved (independently) by Hadamard and de la Vall'ee Poussin in 1896. Their proofs relied on complex analysis, but Erdös and Selberg later found an "elementary" proof.
(1995-04-10)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

### Difficulty index for prime number theorem

Few English speakers likely know this word

### Word Value for prime

9
11
Scrabble Words With Friends