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

The Erd\"{o}s--Straus conjecture states that the equation $\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$ has positive integer solutions $x,y,z$ for every postive integers $n\geq 2$. In this short note we find explicity the solutions of…

Let $(G_n)_{n\geqslant 0}$ be a linear recurrence sequence defining a numeration system and satisfying mild structural hypotheses. For real-valued G-additive functions (additive in the greedy G-digits), we establish an…

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

We prove an inequality on positive real numbers, that looks like a reverse to the well-known Hilbert inequality, and we use some unusual techniques from Fourier analysis to prove that this inequality is optimal.

We give a counterexample to a recently conjectured variant of the Penrose inequality.

In this article using elementary school level Geometry we observe an alternative proof of Pythagorean Theorem from Heron's Formula.

Motivated by previous work leveraging factorizations of second- and fourth-order differential operators, a general integral inequality involving higher order derivatives is proven by elementary means. It is then shown how this framework…

Let $f(N)$ denote the least integer $k$ such that, if $G$ is an abelian group of order $N$ and $A \subseteq G$ is a uniformly random $k$-element subset, then with probability at least $\tfrac12$ the subset-sum set $\{ \sum_{x \in S} x : S…

Problem 2 at the 56th International Mathematical Olympiad (2015) asks for all triples (a,b,c) of positive integers for which ab-c, bc-a, and ca-b are all powers of 2. We show that this problem requires only a primitive form of arithmetic,…

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

We prove Burkholder inequality using Bregman divergence.

The Legendre conjecture has resisted analysis over a century, even under assumption of the Riemann Hypothesis. We present, a significant improvement on previous results by greatly reducing the assumption to a more modest statement called…

We show how Turan's inequality $P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq 0$ for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of this procedure simplifies the daily work with inequalities.…

We give a short proof of a sumset conjecture of Erd\"os, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. The proof is written in the framework of…

The subject of these Notes is the new proof, proposed in [F. H{\'e}lein, In{\'e}galit{\'e} isop{\'e}rim{\'e}trique et calibrations, Annales de l'Institut Fourier 44, 4 (1994), 1211-1218] of the classical isoperimetric inequality in the…

While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…

Using an application of Schmidt's Subspace Theorem, this paper gives new transcendence criteria for rapidly converging infinite products of algebraic numbers. The paper also improves existing criteria for irrationality of products and…

In this article we consider mathematical fundamentals of one method for proving inequalities by computer, based on the Remez algorithm. Using the well-known results of undecidability of the existence of zeros of real elementary functions,…