Related papers: Another inequality inspired by Erd\H{o}s
Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…
We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.
H\"{o}lder's inequality, since its appearance in 1888, has played a fundamental role in Mathematical Analysis and it is, without any doubt, one of the milestones in Mathematics. It may seem strange that, nowadays, it keeps resurfacing and…
Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is…
We study an elementary inequality supporting the classical Hermite-Hadamard inequality in the matrix setting. This leads to a number of interesting matrix inequalities such new Schatten p-norm estimates and new majorization
In this paper we use computational methods to disprove a conjecture by Alaoglu and Erd\H{o}s regarding the superabundant numbers.
A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…
This paper outlines a solution to the Straus Erd\H{o}s Conjecture. Namely for each prime $p$ there exists positive integers $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z} $$
A classical probabilistic explanation for Hardy's quantum paradox is demonstrated.
Unlike some other formal systems, the proof system Metamath has no built-in concept of "decimal number" in the sense that arbitrary digit strings are not recognized by the system without prior definition. We present a system of theorems and…
In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…
For absolutely convergent series we state explicitly a one-sided summation estimate that can be viewed as the discrete analogue of the change of variable formula on the half line. This estimate is implicit in Pascal Lef\`evre's recent…
A set of integers is primitive if no number in the set divides another. We introduce a new method for bounding Erd\H{o}s sums of primitive sets, suggested from output of GPT-5.4 Pro, based on Markov chains with von Mangoldt weights. The…
We prove a one-dimensional Hardy inequality on the halfline with sharp constant, which improves the classical form of this inequality. As a consequence of this new inequality we can rederive known doubly weighted Hardy inequalities. Our…
We prove a certain relation between Legendre's conjecture and Bertrand's postulate in terms of a certain transformation of Legendre's function phi. We show a certain property of a prime.
We present a simple proof of some interpolation inequalities between H\"{o}lder and Lebesgue's spaces. As an example, to demonstrate the simplicity of their applications to nonlinear PDE, we give also a simple proof of an a-priory estimate…
We give a short proof of the fact that every set of natural numbers with positive upper Banach density contains the sum of two infinite sets. The approach simplifies earlier existing proofs.
We study an inequality suggested by Littlewood, our result refines a result of Bennett.
A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $\Omega(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{\Omega(a)}}{a (\log a)^z}$,…
The Erd\H{o}s-Kac theorem is a celebrated result in number theory which says that the number of distinct prime factors of a uniformly chosen random integer satisfies a central limit theorem. In this paper, we establish the large deviations…