OnlineWoerterBuecher.de
Internes

Lexikon


prime number theorem


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)

In addition suitable contents:
[ = ] [ ad ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ b ] [ be ] [ bo ] [ by ] [ ch ] [ co ] [ com ] [ con ] [ de ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ element ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ G ] [ Gauss ] [ gs ] [ h ] [ hat ] [ hing ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ infinity ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ lb ] [ less than ] [ Lex ] [ li ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nf ] [ ng ] [ ni ] [ ns ] [ nu ] [ om ] [ pe ] [ ph ] [ pl ] [ pr ] [ proof ] [ query ] [ rc ] [ re ] [ rl ] [ ro ] [ S ] [ se ] [ si ] [ st ] [ T ] [ tar ] [ th ] [ to ] [ tw ] [ um ] [ us ] [ V ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2539 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1929 Seconds, with 17 Database-Queries
Zurück zur Startseite