English
Related papers

Related papers: Vinogradov's Conjecture and Beyond

200 papers

We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…

Commutative Algebra · Mathematics 2016-05-05 Pete L. Clark

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

Number Theory · Mathematics 2017-06-12 Dimitris Koukoulopoulos

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Number Theory · Mathematics 2022-01-27 Yong-Gao Chen , Yuchen Ding

We give a short proof of the following known congruence: for every odd prime $p$ $$\sum_{k=0}^{p-1}{2k\choose k}^2 16^{-k}\equiv (-1)^{{p-1\over 2}}\pmod{p^2}.$$ Moreover, we provide some new results connected with the above congruence.

Number Theory · Mathematics 2009-11-24 Roberto Tauraso

We prove the abundance theorem for log canonical $n$-folds such that the boundary divisor is big assuming the abundance conjecture for log canonical $(n-1)$-folds. We also discuss the log minimal model program for log canonical $4$-folds.

Algebraic Geometry · Mathematics 2015-11-04 Kenta Hashizume

We give a new proof of Vinogradov's three primes theorem, which asserts that all sufficiently large odd positive integers can be written as the sum of three primes. Existing proofs rely on the theory of L-functions, either explicitly or…

Number Theory · Mathematics 2013-03-12 Xuancheng Shao

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…

Number Theory · Mathematics 2012-10-25 Jean Bourgain , Moubariz Z. Garaev , Sergei V. Konyagin , Igor E. Shparlinski

Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…

Number Theory · Mathematics 2014-09-10 Satwik Mukherjee

In this paper, we prove that every prime $p$ which is congruent to $4,7$ modulo $9$ is the sum of two rational cubes. This is $2/3$ of Sylvester's conjecture which has a history of nearly 150 years since 1879. In the proof, we use recent…

Number Theory · Mathematics 2026-05-27 Hongbo Yin

We prove that any multiplicative subgroup G of the prime field f_p with |G| < p^{1/2} satisfies |3G| \gg |G|^2 / \log |G|. Also, we obtain a bound for the multiplicative energy of any nonzero shift of G, namely E^* (G+x) \ll |G|^2 log |G|,…

Number Theory · Mathematics 2015-04-20 Ilya D. Shkredov

Let $\varepsilon > 0$. We prove that there are constants $m_0=m_0(\varepsilon)$ and $\kappa=\kappa(\varepsilon) > 0$ for which the following holds: For every integer $m > m_0$ and every nontrivial Dirichlet character modulo $m$, there are…

Number Theory · Mathematics 2015-08-25 Paul Pollack

Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $\chi$ be the quadratic character of $\mathbb{F}_q$, and…

Number Theory · Mathematics 2024-03-29 Vefa Goksel , Giacomo Micheli

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

Suppose $((\cdots((x^{2}-c_{1})^{2}-c_{2})^{2}\cdots)^{2}-c_{k-1})^{2}-c_{k}$ splits into linear factors over $\mathbb{Z}$ and $c_{k}\neq0$. We show that for each $j$ and each prime $p$, if $p\leq2^{j-1}$ then $p$ divides $c_{j}$.…

Number Theory · Mathematics 2019-03-01 Shawn Walker

Let $p_n$ denote the $n$-th prime, and for any $k \geq 1$ and sufficiently large $X$, define the quantity $$ G_k(X) := \max_{p_{n+k} \leq X} \min( p_{n+1}-p_n, \dots, p_{n+k}-p_{n+k-1} ),$$ which measures the occurrence of chains of $k$…

Number Theory · Mathematics 2019-10-22 Kevin Ford , James Maynard , Terence Tao

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Number Theory · Mathematics 2024-02-26 David J. Grynkiewicz

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

Number Theory · Mathematics 2011-02-08 Ana Zumalacárregui

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

A strong version of Andrica's conjecture can be formulated as follows: Except for $p_n\in\{3,7,13,23,31,113\}$, that is $n\in\{2,4,6,9,11,30\}$, one has$\sqrt{p_{n+1}}-\sqrt{p_n} < \frac{1}{2}.$ While a proof is far out of reach I shall…

Number Theory · Mathematics 2025-04-29 Matt Visser

Two conjectures, posed by Finch-Smith, Harrington, and Wong in a paper published in Integers in $2023$, are proven. Given a monic biquadratic polynomial $f(x) = x^4 + cx^2 + e$, we prove a formula for the sum of its distinct outputs modulo…

Number Theory · Mathematics 2023-09-26 Samer Seraj