中文
相关论文

相关论文: The Romanov theorem revised

200 篇论文

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…

数论 · 数学 2023-08-29 Wade Hindes , Reiyah Jacobs , Benjamin Keller , Albert Kim , Peter Ye , Aaron Zhou

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

数论 · 数学 2016-07-29 Steve Wright

A monogenic polynomial $f$ is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime $q$, using the Chebotarev density theorem, we will show the density of primes $p$, such that…

数论 · 数学 2014-06-17 Mohammad Bardestani

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

数论 · 数学 2007-05-23 Ernie Croot , Christian Elsholtz

Let $g \in L^2(\mathbb{R})$ be a rational function of degree $M$, i.e. there exist polynomials $P, Q$ such that $g = {{P} \over {Q}}$ and $deg(P) < deg(Q) \leq M$. We prove that for any $\varepsilon>0$ and any $M \in \mathbb{N}$ there…

泛函分析 · 数学 2025-10-31 Andrei V. Semenov

Let $\gamma(t)=(P_1(t),\ldots,P_n(t))$ where $P_i$ is a real polynomial with zero constant term for each $1\leq i\leq n$. We will show the existence of the configuration $\{x,x+\gamma(t)\}$ in sets of positive density $\epsilon$ in…

经典分析与常微分方程 · 数学 2024-10-14 Xuezhi Chen , Changxing Miao

We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…

数论 · 数学 2015-06-12 Eric Naslund

Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…

数论 · 数学 2024-08-14 Deepa Antony , Rupam Barman

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…

数论 · 数学 2024-02-26 David J. Grynkiewicz

Fix an integer $r\geq 3$. Let $q$ be a large positive integer and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. In this paper, we establish an asymptotic formula for the logarithmic density…

数论 · 数学 2011-01-06 Youness Lamzouri

Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists…

数论 · 数学 2021-07-27 Stelios Sachpazis

We prove that any positive rational number is the sum of distinct unit fractions with denominators in $\{p-1 : p\textrm{ prime}\}$. The same conclusion holds for the set $\{p-h : p\textrm{ prime}\}$ for any $h\in\mathbb{Z}\backslash\{0\}$,…

数论 · 数学 2026-01-14 Thomas F. Bloom

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

组合数学 · 数学 2015-06-02 Przemysław Mazur

We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…

综合数学 · 数学 2025-06-17 Paul Alexander Bilokon

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

组合数学 · 数学 2026-05-08 Ruben Carpenter , Colin Defant , Noah Kravitz

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

数论 · 数学 2007-05-23 Ernie Croot

Ideas from physics are used to show that the prime pairs have the density conjectured by Hardy and Littlewood. The proof involves dealing with infinities like in quantum field theory.

高能物理 - 理论 · 物理学 2007-05-23 G. H. Gadiyar , R. Padma

Let $A$ be the product of an abelian variety and a torus over a number field $K$, and let $m$ be a positive integer. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

数论 · 数学 2021-07-01 Peter Bruin , Antonella Perucca

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

数论 · 数学 2021-02-12 Ron Brown

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

数论 · 数学 2012-07-30 Pieter Moree