Related papers: Another inequality inspired by Erd\H{o}s
Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…
This essay offers a brief biography of Paul Erd\H{o}s and summarizes his approach to mathematics. This is further elucidated by a discussion of Erd\H{o}s' simple proof of Bertrand's Postulate.
We add a few ideas to Erd\H{o}s's proof of Bertrand's Postulate to produce one using a little calculus but requiring direct check only for $n\leq 5$ and one without using calculus and requiring direct check only for $n\leq 12$. The proofs…
In this paper we give an elementary proof for Bertrand's postulate also known as Bertrand-Chebyshev theorem.
The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…
A strictly increasing sequence $\mathscr{A}$ of positive integers is said to be primitive if no term of $\mathscr{A}$ divides any other. Erd\H{o}s showed that the series $\sum_{a \in \mathscr{A}} \frac{1}{a \log a}$, where $\mathscr{A}$ is…
In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…
Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…
The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…
We establish some new generalizations of Erd\H{o}s-Mordell inequality by adding weights to its terms. Using these generalizations, we derived strengthened versions of the original Erd\H{o}s-Mordell inequality. We also found two other…
In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…
In this paper, we are going to prove a famous problem concerning prime numbers. Bertrand postulate states that there is always a prime p with n < p < 2n, if n > 1. Bertrand postulate is not a newer one to be proven, in fact, after his…
Bertrand's paradox is a famous problem of probability theory, pointing to a possible inconsistency in Laplace's principle of insufficient reason. In this article we show that Bertrand's paradox contains two different problems: an "easy"…
In a landmark paper on arithmetical properties of Lambert series, Erd\H{o}s proved that $\sum_{n=1}^{\infty} \frac{1}{2^{n} - 1}$ is irrational. This value $E$ is now referred to as the Erd\H{o}s-Borwein constant. Crandall, in 2012, studied…
An elementary proof of Bertrand's theorem is given by examining the radial orbit equation, without needing to solve complicated equations or integrals.
A simple proof of the weighted two variable geometric-arithmetic a mean inequality based on one given earlier valid only for integer weights
A set of integers greater than 1 is primitive if no element divides another. Erd\H{o}s proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked…
Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…
A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…
We give a new elementary proof of Landau's Prime Ideal Theorem. The proof is an extension of Richter's proof of the Prime Number Theorem. The main result contains other results related to the equidistribution of the prime ideal counting…