English
Related papers

Related papers: A solution to the Straus-Erd\H{o}s conjecture

200 papers

In this paper, we mainly prove two congruence conjecture of Z.-W. Sun. Let $p\equiv3\pmod 4$ be a prime. Then $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{8^k}\equiv-\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{(-16)^k}\pmod{p^3}.$$ And for any odd prime…

Number Theory · Mathematics 2023-04-11 Guo-Shuai Mao

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$…

Combinatorics · Mathematics 2020-02-13 Esen Aksoy Yazici

In the present paper we prove that under the assumption of the GRH (Generalized Riemann Hypothesis) each sufficiently large odd integer can be expressed as the sum of a prime and two isolated primes.

Number Theory · Mathematics 2016-06-14 Helmut Maier , Michael Th. Rassias

A well-known conjecture of Erd\H{o}s and S\'os states that every graph with average degree exceeding $m-1$ contains every tree with $m$ edges as a subgraph. We propose a variant of this conjecture, which states that every graph of maximum…

Combinatorics · Mathematics 2020-12-14 Frédéric Havet , Bruce Reed , Maya Stein , David R. Wood

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

Number Theory · Mathematics 2014-08-08 Hao Pan , Zhi-Wei Sun

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

General Mathematics · Mathematics 2018-02-08 Richard Williamson

For any odd prime number $p$, let $(\cdot|p)$ be the Legendre symbol, and let $n_1(p)<n_2(p)<\cdots$ be the sequence of positive nonresidues modulo $p$, i.e., $(n_k|p)=-1$ for each $k$. In 1957, Burgess showed that the upper bound…

Number Theory · Mathematics 2015-11-18 William D. Banks , Victor Z. Guo

We examine the following fourth order H\'enon equation \label{pipe} \Delta^2 u = |x|^\alpha u^p \qquad \text{in}\ \IR^N, where $ 0 < \alpha$. Define the Hardy-Sobolev exponent $ p_4(\alpha):= \frac{N+4 + 2 \alpha}{N-4}$. We show that in…

Analysis of PDEs · Mathematics 2011-10-12 Craig Cowan

Employing the $q$-Lucas theorem and some known $q$-supercongruences, we give some Dwork-type $q$-congruences, confirming three conjectures in [J. Combin. Theory, Ser. A 178 (2021), Art.~105362]. As conclusions, we obtain the following…

Number Theory · Mathematics 2023-10-25 Victor J. W. Guo

In this paper, we mainly prove a congruence conjecture of Z.-W. Sun \cite{Sjnt}: Let $p>5$ be a prime. Then $$ \sum_{k=(p+1)/2}^{p-1}\frac{\binom{2k}k^2}{k16^k}\equiv-\frac{21}2H_{p-1}\pmod{p^4}, $$ where $H_n$ denotes the $n$-th harmonic…

Number Theory · Mathematics 2026-01-26 Guo-Shuai Mao

Hardy showed that $\sum_{n \ioe x}\tau(n)-x(\log x +2\gamma -1)$ is not $o(x^{1/4})$. In this article, we prove that $\sum_{n \ioe x}\tau(n)(1-\frac{x}{n})-xP(\log x)=\frac{1}{4}+O \left( \frac{\log x}{x^{1/4}} \right)$, where $P$ is a…

Number Theory · Mathematics 2026-01-13 Olivier Bordellès , Florian Daval

Let $\epsilon_{1},\ldots,\epsilon_{n}$ be a sequence of independent Rademacher random variables. We prove that there is a constant $c>0$ such that for any unit vectors $v_1,\ldots,v_n\in \mathbb{R}^2$, $$\Pr\left[||\epsilon_1…

Probability · Mathematics 2024-12-31 Xiaoyu He , Tomas Juskevicius , Bhargav Narayanan , Sam Spiro

A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…

Combinatorics · Mathematics 2018-10-30 Václav Rozhoň

In this paper, we confirm some congruences conjectured by V.J.W. Guo and M.J. Schlosser recently. For example, we show that for primes $p>3$, $$…

Number Theory · Mathematics 2020-06-30 Chen Wang

The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…

Combinatorics · Mathematics 2025-08-13 Bruce Reed , Maya Stein

The Delannoy numbers and Schr\"oder numbers are given by \begin{align*} D_n=\sum_{k=0}^n{n\choose k}{n+k\choose k}\quad \text{and}\quad S_n=\sum_{k=0}^n{n\choose k}{n+k\choose k}\frac{1}{k+1}, \end{align*} respectively. Let $p>3$ be a…

Number Theory · Mathematics 2017-08-31 Ji-Cai Liu

Let $N$ be a sufficiently large real number. In this paper, it is proved that, for $1<c<\frac{1193}{889}$, the following Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c+p_4^c-N\big|<\log^{-1}N \end{equation*} is solvable in…

Number Theory · Mathematics 2018-11-27 Min Zhang , Jinjiang Li

Let $\frac{a_1}{b_1}, \frac{a_2}{b_2}, \ldots$ be the Farey fractions of order $n$. We then prove that the inequality $(a_l - a_k)(b_l - b_k) \ge 0$ holds for all $k$ and $l > k$ with $l-k \le \left(\frac{1}{12} - o(1) \right)n$, sharpening…

Number Theory · Mathematics 2025-09-03 Wouter van Doorn

We prove that the equation ${ (x - y)^4 + x^4 + (x + y)^4 = z^n }$ has no integer solutions ${ x, y, z}$ with ${ \gcd(x, y) = 1 }$ for all integers ${ n > 1 }$. We mainly use a modular approach with two Frey ${ \mathbb{Q} }$-curves defined…

Number Theory · Mathematics 2021-02-18 Joey M. van Langen

We investigate the following fractional $p$-Laplacian equation \[ \begin{cases} \begin{aligned} (-\Delta)_p^s u&=\lambda |u|^{q-2}u+|u|^{p_s^*-2}u &&\text{in}~\Omega,\\ u &=0 &&\text{in}~ \mathbb{R}^n\setminus\Omega, \end{aligned}…

Analysis of PDEs · Mathematics 2023-08-16 Weimin Zhang