On a theorem of Edmund Landau (Q2762844)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1689554
Language Label Description Also known as
default for all languages
No label defined
    English
    On a theorem of Edmund Landau
    scientific article; zbMATH DE number 1689554

      Statements

      13 January 2002
      0 references
      Landau's inequality
      0 references
      approximation of \(\pi(x)\)
      0 references
      convex functions
      0 references
      On a theorem of Edmund Landau (English)
      0 references
      Let \(\pi(x)\) denote the number of primes \(\leq x\). The Landau theorem states that \(\pi(2x)\leq 2 \pi(x)\) for \(x\geq x_0\). Since 1969 it is known that this holds for \(x_0=2\). In connection with this result and the famous Hardy and Littlewood conjecture: \(\pi(x+y)\leq \pi(x)+\pi(y),x,y\geq 2\), the author proves that \(\pi(x+y)\leq 2[\pi(x)+\pi(y)]-2\pi(\sqrt{xy})\), and that \(\pi(2\sqrt{xy})\leq \pi(x)+\pi(y)\) \((x,y\geq 2)\). The proof uses results of Rosser and Schoenfeld, some recent results due to the author, as well as certain convex functions.
      0 references

      Identifiers