中文
相关论文

相关论文: Long arithmetic progressions of primes

200 篇论文

Let $X$ be the number of $k$-term arithmetic progressions contained in the $p$-biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on the logarithmic upper-tail probability $\log \Pr(X \ge E[X] +…

概率论 · 数学 2024-09-16 Matan Harel , Frank Mousset , Wojciech Samotij

Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.

数论 · 数学 2008-11-27 Cristian Cobeli

By combining a sieve method of Harman with the work of Maynard and Tao we show that $$\liminf_{n\rightarrow \infty}(p_{n+m}-p_n)\ll \exp(3.815m).$$

数论 · 数学 2015-05-08 R. C. Baker , A. J. Irving

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

数论 · 数学 2019-06-14 Luka Rimanic , Julia Wolf

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

We study \'etale descent of derivations of algebras with values in a module. The algebras under consideration are twisted forms of algebras over rings, and apply to all classes of algebras, notably associative and Lie algebras, such as the…

环与代数 · 数学 2013-12-17 Erhard Neher , Arturo Pianzola

We survey the classical results on the prime number theorem

数论 · 数学 2007-05-23 Yong-Cheol Kim

Given a sequence $\{b_{i}\}_{i=1}^{n}$ and a ratio $\lambda \in (0,1),$ let $E=\cup_{i=1}^n(\lambda E+b_i)$ be a homogeneous self-similar set. In this paper, we study the existence and maximal length of arithmetic progressions in $E$. Our…

数论 · 数学 2019-01-23 Kan Jiang , Qiyang Pei , Lifeng Xi

Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x^{1/2-c+\eps}) steps for some absolute constant c. We propose a slightly different approach, which leads to the…

数论 · 数学 2013-09-23 Andrew V. Lelechenko

We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by…

数论 · 数学 2007-05-23 Ben Green

The work is devoted to the construction of a new interval arithmetic which would combine algorithmic efficiency and high quality estimation of the ranges of expressions.

数值分析 · 数学 2022-04-21 Dmitry A. Skorik

Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…

数论 · 数学 2025-07-08 Sun-Kai Leung

This text is a survey of the general theory of stochastic processes, with a view towards random times and enlargements of filtrations. The first five chapters present standard materials, which were developed by the French probability school…

概率论 · 数学 2007-05-23 Ashkan Nikeghbali

This is an expository talk on a topic of classical analysis, arising from the VMO theory of the topological degree due to Br\'ezis and Nirenberg (1995). We sketch the history of the subject and some of its recent developments. The paper is…

经典分析与常微分方程 · 数学 2010-03-31 Jean-Pierre Kahane

Part-and-parcel of the study of "multiplicative number theory" is the study of the distribution of multiplicative functions in arithmetic progressions. Although appropriate analogies to the Bombieri-Vingradov Theorem have been proved for…

数论 · 数学 2019-04-22 Andrew Granville , Xuancheng Shao

We present a new, elementary, dynamical proof of the prime number theorem.

数论 · 数学 2021-05-25 Redmond McNamara

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

数论 · 数学 2007-08-09 William D. Banks , Igor E. Shparlinski

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

数论 · 数学 2025-08-12 Soumya Bhattacharya , Habibur Rahaman

Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…

综合数学 · 数学 2009-09-15 Shaohua Zhang

We give an explicit description of the Lie algebra of derivations for a class of infinite dimensional algebras which are given by \'etale descent. The algebras under consideration are twisted forms of central algebras over rings, and…

环与代数 · 数学 2009-01-30 Arturo Pianzola