中文
相关论文

相关论文: Arbitrarily long strings of consecutive primes in …

200 篇论文

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.

数论 · 数学 2024-01-30 Terence Tao , Tamar Ziegler

Let $l$ be a rational prime greater than or equal to $3$ and $k$ be a given positive integer. Under a conjecture due to Langland and an assumption on upper bound for the regulator of fields of the form $\mathbb{Q}\left(\sqrt[l]a\right)$, we…

数论 · 数学 2025-04-08 Jishu Das , Srilakshmi Krishnamoorthy

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…

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

数论 · 数学 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

The study of finding blocks of primes in certain arithmetic sequences is one of the classical problems in number theory. It is also very interesting to study blocks of consecutive elements in such sequences that are pairwise coprime. In…

数论 · 数学 2025-06-27 Jean-Marc Deshouillers , Sunil Naik

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

数论 · 数学 2026-02-26 Artyom Radomskii

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…

数论 · 数学 2025-06-27 Jean-Marc Deshouillers , Sunil Naik

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

组合数学 · 数学 2021-08-31 Jakub Konieczny

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

综合数学 · 数学 2019-04-02 N. A. Carella

Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…

数论 · 数学 2020-12-08 Bernard Montaron

Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.

数论 · 数学 2021-12-22 Randell Heyman

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

数论 · 数学 2007-09-23 Ben Green , Terence Tao

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

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…

数论 · 数学 2022-12-08 Katherine Benjamin

In this article we consider the completely multiplicative sequences $(a_n)_{n \in \mathbf{N}}$ defined on a field $\mathbf{K}$ and satisfying $$\sum_{p| p \leq n, a_p \neq 1, p \in \mathbf{P}}\frac{1}{p}<\infty,$$ where $\mathbf{P}$ is the…

数论 · 数学 2017-08-16 Shuo Li

In this paper Euler shows how, if we have recursive functions f,g,h and an infinite sequence A,B,C,... which satisfies fA=gB+hC, f'B=g'C+h'D, f''C=g''D+h''E, f'''D=g'''E+h'''F, etc., where the primes denote an index not a derivative, then…

历史与综述 · 数学 2007-05-23 Leonhard Euler

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

经典分析与常微分方程 · 数学 2016-03-21 Manas R. Sahoo

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

数论 · 数学 2013-03-01 Terence Tao , Tamar Ziegler

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

综合数学 · 数学 2026-01-23 Edwige Tolla

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

数论 · 数学 2021-05-28 Jianya Liu , Lilu Zhao
‹ 上一页 1 2 3 10 下一页 ›