English
Related papers

Related papers: Exceptions to the Erd\H os--Straus--Schinzel conje…

200 papers

An old conjecture of Sierpinski asserts that for every integer k \ge 2, there is a number m for which the equation \phi(x)=m has exactly k solutions. Here \phi is Euler's totient function. In 1961, Schinzel deduced this conjecture from his…

Number Theory · Mathematics 2016-09-07 Kevin Ford

In $1963$ Graham proved that every positive integer $n \ge 78$ can be written as a sum of distinct positive integers $a_1, a_2, \ldots, a_r$ for which $\frac{1}{a_1} + \frac{1}{a_2} + \ldots + \frac{1}{a_r}$ is equal to $1$. In the same…

Number Theory · Mathematics 2025-07-25 Wouter van Doorn

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2017-07-31 Angel Kumchev , Huafeng Liu

Let $ES(n)$ be the minimal integer such that any set of $ES(n)$ points in the plane in general position contains $n$ points in convex position. The problem of estimating $ES(n)$ was first formulated by Erd\H{o}s and Szekeres, who proved…

Combinatorics · Mathematics 2015-09-14 Sergey Norin , Yelena Yuditsky

Erd\H{o}s and Graham proposed to determine the number of subsets $S \subseteq \left\{1,2,\dots,n\right\}$ with $\sum_{s \in S} 1/s = 1$ and asked, among other things, whether that number could be as large as $2^{n - o(n)}$. We show that the…

Combinatorics · Mathematics 2024-04-30 Stefan Steinerberger

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…

Combinatorics · Mathematics 2026-05-12 Chunchao Fan , Mingze Li , Qizhong Lin , Bo Ning

For $m\geq 1$, let $0<b_0<b_1<...<b_m$ and $\ e_0,e_1,...,e_m>0$ be fixed positive integers. Assume there exists a prime $p$ and an integer $t>0$ such that $p^t\mid b_0$, but $p^t\nmid b_{i}\ {\rm for}\ 1\leq i\leq m$. Then, we prove that…

Number Theory · Mathematics 2011-08-31 Yan Li , Lianrong Ma

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This conjecture was first proposed by German mathematician Christian Goldbach in 1742 and, despite being obviously true,…

General Mathematics · Mathematics 2025-08-12 Kenneth A. Watanabe

In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n,9(n+3)/8]$. Based on this result, we prove that if $a$ is an integer greater than 1, then for every integer $n>14.4a$ there are at…

Number Theory · Mathematics 2013-09-03 Germán Paz

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

Let $S_k(m):=\sum_{j=1}^{m-1}j^k$ denote a power sum. In 2011, Kellner proposed the conjecture that for $m>3$ the ratio $S_k(m+1)/S_k(m)$ is never an integer, or, equivalently, that for any positive integer $a$, the equation $aS_k(m)=m^k$…

Number Theory · Mathematics 2019-01-10 Ioulia N. Baoulina

The tensor square conjecture states that for $n \geq 10$, there is an irreducible representation $V$ of the symmetric group $S_n$ such that $V \otimes V$ contains every irreducible representation of $S_n$. Our main result is that for large…

Combinatorics · Mathematics 2020-11-10 Sammy Luo , Mark Sellke

We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 5/8, then all sufficiently large odd positive integers can be written as the sum of three primes in A. The constant 5/8 in this statement…

Number Theory · Mathematics 2015-01-14 Xuancheng Shao

In this paper we classify certain values of p that satisfy the Erdos-Straus conjecture, concerning the decomposition of fractions of the form 4/n as sum of three fractions with numerator identically equal to 1, not according to their…

Number Theory · Mathematics 2024-08-22 Miguel Angel Lopez

We prove some supercongruence and divisibility results on sums involving Domb numbers, which confirm four conjectures of Z.-W. Sun and Z.-H. Sun. For instance, by using a transformation formula due to Chan and Zudilin, we show that for any…

Number Theory · Mathematics 2020-08-18 Ji-Cai Liu

In 2013, Farhi conjectured that for each $m\geq 3$, every natural number $n$ can be represented as $\lfloor x^2/m\rfloor+\lfloor y^2/m\rfloor+\lfloor z^2/m\rfloor$ with $x,y,z\in\Z$, where $\lfloor\cdot\rfloor$ denotes the floor function.…

Number Theory · Mathematics 2025-03-04 Hai-Liang Wu , He-Xia Ni , Hao Pan

For $m\geq 1$, let $0<b_0<b_1<...<b_m$ and $\ e_0,e_1,...,e_m>0$ be fixed positive integers. Assume there exists a prime $p$ and an integer $t>0$ such that $p^t\mid b_0$, but $p^t\nmid b_{i}\ {\rm for}\ 1\leq i\leq m$. Then, we prove that…

Number Theory · Mathematics 2011-08-31 Yan Li , Lianrong Ma

For any $m \geq 1$, let $H_m$ denote the quantity $\liminf_{n \to \infty} (p_{n+m}-p_n)$. A celebrated recent result of Zhang showed the finiteness of $H_1$, with the explicit bound $H_1 \leq 70000000$. This was then improved by us (the…

Number Theory · Mathematics 2014-12-23 D. H. J. Polymath

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.

Number Theory · Mathematics 2025-09-03 Spiridon Mihnea , Dumitru C. Bogdan

For positive integers m and r, one can easily show there exist integers N such that for every map D:{1,2,...,N} -> {1,2,...,r} there exist 2m integers x_1 < ... < x_m < y_1 < ... < y_m which satisfy: (a) D(x_1) = ... = D(x_m), (b) D(y_1) =…

Combinatorics · Mathematics 2007-05-23 Andrew Schultz