Related papers: Another inequality inspired by Erd\H{o}s

We established a physically utilizable Bell inequality based on the Peres-Horodecki criterion. The new quadratic probabilistic Bell inequality naturally provides us a necessary and sufficient way to test all entangled two-qubit or…

Using as the working hypothesis of an evaluation of the difference between primes $p_{n+1} - p_n = O(\sqrt{p_n})$ we represent in detail the proofs of Legendre's and Oppermann's conjectures.

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

In this short note we present some remarks and conjectures on two of Erd\"os's open problems in number theory.

G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…

This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…

The Li\'{e}nard equation is of a high importance from both mathematical and physical points of view. However a question about integrability of this equation has not been completely answered yet. Here we provide a new criterion for…

In this paper we make a Gaussian integer version of the Erd\H{o}s-Straus conjecture and we solve the Erd\H{o}s-Straus diophantine equation over the rings of integers of norm-Euclidean quadratic fields.

In this work, a generalization of the well known Bernoulli inequality is obtained by using the theory of discrete fractional calculus. As far as we know our approach is novel.

It is an open question of Erd\H{o}s as to whether the alternating series $\sum_{n=1}^\infty \frac{(-1)^n n}{p_n}$ is (conditionally) convergent, where $p_n$ denotes the $n^{\mathrm{th}}$ prime. By using a random sifted model of the primes…

In this paper, we study the linear independence between the distribution of the number of prime factors of integers and that of the largest prime factors of integers. Respectively, under a restriction on the largest prime factors of…

Let $d(\cdot)$ denote the natural density on the positive integers. We characterize all sets $A,B$ with positive density satisfying $d(A+B)=d(A)+d(B)$, under the assumption that the two sets are not both contained in a proper finite union…

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

A result of Legendre asserts that the difference between the numbers of (length) even and odd partitions of $n$ into distinct parts is $0$, $1$, or $-1$; this also follows from Euler's pentagonal number theorem. We establish an analogous…

We investigate Bertrand's probabilistic paradox through the lens of discrete geometry and old-fashioned but reliable discrete probability. We approximate the plane unit circle with $1/n$ times $1/n$ boxes and count the pairs of boxes…

We present an astonishingly simple and elegant proof of the celebrated Basel problem.

Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.