Related papers: Another inequality inspired by Erd\H{o}s
We present a conclusive answer to Bertrand's paradox, a long standing open issue in the basic physical interpretation of probability. The paradox deals with the existence of mutually inconsistent results when looking for the probability…
Consider an algebraic number field, $K$, and its ring of integers, $\mathcal{O}_K$. There exists a smallest $B_K>1$ such that for any $x>1$ we can find a prime ideal, $\mathfrak{p}$, in $\mathcal{O}_K$ with norm $N(\mathfrak{p})$ in the…
We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…
The purpose of this letter is to point out an argument which may ultimately lead to a rigorous proof of the Penrose inequality in the general case. The argument is a variation of Geroch's original proposal for a proof of the positive energy…
We give an historical account, including recent progress, on some problems of Erd\H os in number theory.
In this note, we propose a conjecture stating that some series involving primitive sequences are convergent. Then, we show (by a counterexample) that the analogue of a conjecture of Erd\H{o}s, for those series, is false.
We provide empirical evidence for the Erd\H{o}s-Straus conjecture by improving computational bounds to $10^{18}$ and by evaluating the solution-counting function $f(p)$ for this conjecture.
New partial results are obtained related to the following old problem of Erd\"os: for any infinite set $X$ of real numbers to show that there is always a measurable (or, equivalently, closed) subset of reals of positive Lebesgue measure…
The aim of this note is to attract attention of experimenters to the original Bell (OB) inequality which was shadowed by the common consideration of the CHSH inequality. There are two reasons to test the OB inequality and not the CHSH…
This paper is intended as a sequel to a paper arXiv:0803.2636 written by four of the coauthors here. In the paper, they proved a stronger form of the Erd\H{o}s-Mirksy conjecture which states that there are infinitely many positive integers…
In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.
An interesting episode in the history of the prime number theorem concerns a formula proposed by Legendre for counting the primes below a given bound. We point out that arithmetic bias likely played an important role in arriving at that…
The classical theorem of Erd\H os \& Wintner furnishes a criterion for the existence of a limiting distribution for a real, additive arithmetical function. This work is devoted to providing an effective estimate for the remainder term under…
We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.
We formulate and discuss a conjecture which would extend a classical inequality of Bernstein.
In this article we take a probabilistic look at H\"older's inequality, considering the ratio of terms in the classical H\"older inequality for random vectors in $\mathbb{R}^n$. We prove a central limit theorem for this ratio, which then…
We prove some extensions of Andrews inequality.
Considering Wirtinger's inequality for piece-wise equipartite functions we find a discrete version of this classical inequality. The main tool we use is the theorem of classification of isometries. Our approach provides a new elementary…
We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…
In this paper, we prove Erd\H{o}s distance conjecture in $\mathbb{R}^d$, namely, a set of $n$ points in $\mathbb{R}^2$ determines $\Omega(\frac{n}{\sqrt{\log n}})$ distances, and for $d\ge 3$, a set of $n$ points in $\mathbb{R}^d$…