中文
相关论文

相关论文: Vinogradov's three primes theorem with almost twin…

200 篇论文

Let $\sigma(n)$ be the sum of the positive divisors of $n$. A positive integer $n$ is said to be $2$-near perfect when $\sigma(n)=2n+d_1+d_2$, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We show that there are no odd…

The first purpose of our paper is to show how Hooley's celebrated method leading to his conditional proof of the Artin conjecture on primitive roots can be combined with the Hardy-Littlewood circle method. We do so by studying the number of…

数论 · 数学 2020-05-19 Christopher Frei , Peter Koymans , Efthymios Sofos

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

数论 · 数学 2024-01-04 Yuhui Liu

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

数论 · 数学 2025-04-14 Daniel R. Johnston , Valeriia V. Starichkova

Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underline{\delta}(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if…

数论 · 数学 2016-03-02 Quanli Shen

The ternary Goldbach conjecture states that every odd number $m \geqslant 7$ can be written as the sum of three primes. We construct a set of primes $\mathbb{P}$ defined by an expanding system of admissible congruences such that almost all…

We prove that there exists a k_0>0 such that every sufficiently large odd integer n with 3\mid n can be represented as p_1+p_2+p_3, where p_1,p_2 are Chen's primes and p_3 is a prime with p_3+2 has at most k_0 prime factors.

数论 · 数学 2008-12-25 Hongze Li , Hao Pan

In this paper we prove three results conjectured by Z.-W. Sun. Let $p$ be an odd prime and let $h\in \mathbb{Z}$ with $2h-1\equiv0\pmod{p^{}}$. For $a\in\mathbb{Z}^{+}$ and $p^a>3$, we show that \begin{align}\notag…

组合数学 · 数学 2019-11-04 Yong Zhang

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…

数论 · 数学 2024-06-14 Joel E. Cohen

The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…

数论 · 数学 2014-10-31 Andrew Granville

We proved that any even number not less than 6 can be expressed as the sum of two old primes, $2n=p_i+p_j$

综合数学 · 数学 2007-05-23 Shouyu Du , Zhanle Du

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.

数论 · 数学 2016-06-14 Helmut Maier , Michael Th. Rassias

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold…

数论 · 数学 2016-01-20 Terence Tao

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

数论 · 数学 2025-09-10 Moubariz Z. Garaev , Julio C. Pardo , Igor E. Shparlinski

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

数论 · 数学 2015-09-08 Janos Pintz

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…

数论 · 数学 2021-01-22 Matteo Bordignon

Some mean value theorems in the style of Bombieri-Vinogradov's theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean…

数论 · 数学 2012-12-19 Karin Halupczok

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

数论 · 数学 2023-01-09 Ernie Croot , Hamed Mousavi , Maxie Schmidt

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…