M. Z. Garaev
Let $λ$ be a fixed integer, $λ\ge 2.$ Let $s_n$ be any strictly increasing sequence of positive integers satisfying $s_n\le n^{15/14+o(1)}.$ In this paper we give a version of the large sieve inequality for the sequence $λ^{s_n}.$ In particular, we prove that for $π(X)(1+o(1))$ primes $p, \ p\le X,$ the numbers $$ λ^{s_n},\quad n\le X(\log X)^{2+ε} $$ are uniformly distributed modulo $p.$
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
This paper is motivated by the following question in sieve theory. Given a subset $X\subset [N]$ and $α\in (0,1/2)$. Suppose that $|X\pmod p|\leq (α+o(1))p$ for every prime $p$. How large can $X$ be? On the one hand, we have the bound $|X|\ll_αN^α$ from Gallagher's larger sieve. On the other hand, we prove, assuming the truth of an inverse sieve conjecture, that the bound above can be improved (for example, to $|X|\ll_αN^{O(α^{2014})}$ for small $α$). The result follows from studying the average size of $|X\pmod p|$ as $p$ varies, when $X=f(\mathbb{Z})\cap [N]$ is the value set of a polynomial…
We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number theorem.
We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form $λ^{s_n}$. In particular, we obtain a result which is non-trivial for monotonically increasing sequences $\cal{S}=\{s_n \}_{n=1}^{\infty}$ provided $s_n\le n^{2+o(1)}$, whereas the original argument of M. Z. Garaev requires $s_n \le n^{15/14 +o(1)}$ in the same setting. We also give an application of our result to arithmetic properties of integers with almost all digits prescribed.
In this paper we consider a slightly different sieve method from Eratosthenes' to get primes. We find the periodicity and mirror symmetry of the pattern.
We give a more comrehensive treatment of Chen's double sieve and improve related constants in Goldbach's conjecture and the twin prime problem.
In this paper, we develop a large sieve type inequality for some special characters whose moduli are squares of primes. Our result gives non-trivial estimate in certain ranges.
We make two algorithms that generate all prime numbers up to a given limit, they are a development of sieve of Eratosthenes algorithm, we use two formulas to achieve this development, where all the multiples of prime number 2 are eliminated in the first formula, and all the multiples of prime numbers 2 and 3 are eliminated in the second formula. Using the first algorithm we proof sieve of Sundaram's algorithm, then we improve it to be more efficient prime generating algorithm. We will show the difference in performance between all the algorithms we will make and sieve of Eratosthenes algorithm…
For every even integer N, denote by D_{1,2}(N) the number of representations of N as a sum of a prime and an integer having at most two prime factors. In this paper, we give a new lower bound for D_{1,2}(N).
This article develops a new sieve method which by adding an additional axiom to the classical formulation breaks the well-known parity problem and allows one to detect primes in thin, interesting integer sequences. In the accompanying paper [math.NT/9811184] the practicality of the axiom is demonstrated by verifying it (and the other axioms) to produce primes in the sequence a^2+b^4 with the relevant asymptotics.
We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was log p to an exponent tending to infinity with p, lies in the use of the linear sieve (a particular version called the shifted sieve) rather than Brun's sieve. The same methods allow us to rederive a conditional result of Shoup on the least prime primitive root (mod p) for all prime moduli p, assuming the generalized Riemann hypothesis. We also extend both res…
This is an extension and background to a talk I gave on 9 October 2013 to the Brown Graduate Student Seminar, called `A friendly intro to sieves with a look towards recent progress on the twin primes conjecture.' During the talk, I mention several sieves, some with a lot of detail and some with very little detail. I also discuss several results and built upon many sources. I'll provide missing details and/or sources for additional reading here.
A weaker but simpler sieve inequality
研究筛权消去性质，用于极短区间素数和殆素数分布，提出较弱但更简单的筛法不等式。
A Positive Lower Bound for the Sum of Log-Reciprocal Twin Prime Products via Weighted Sieve
本文通过改进加权筛法，证明了孪生素数乘积对数倒数之和的正下界，从而推导出孪生素数对的无限性。
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences are known as constellations. By studying this recursion on the cycles of gaps across stages of Eratosthenes sieve, we are able to provide evidence on a number of open problems regarding gaps between prime numbers. The basic counts of short constellations in the cycles of gaps provide evidence toward the twin prime conjecture and toward resolving a series of q…
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg sieve.
We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is essentially the same as the one in Hardy and Wright. However, the second method is novel. It results in the same asymptotic formula but it uses a simpler correction factor than theirs. Though we have no theory for the accuracy of our estimates, we compute them both without and with the correction factor and they turn out to be close to the actual counts up to 800…
We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of prime factors of irreducible polynomials at prime arguments. In particular, we prove that irreducible quadratics over $\mathbb{Z}$ satisfying necessary local conditions are $P_4$ infinitely often.
The number of primes in short intervals and numerical calculations for Harman's sieve
本文通过精细的筛法分解和数值计算，改进了短区间素数个数的上下界，证明了$[x-x^{0.52},x]$对充分大的$x$恒有素数。
Sieves are constructed for twin primes in class I, which are of the form 2m+/-D, D>=3 odd. They are characterized by their twin-D-I rank m. They have no parity problem. Non-rank numbers are identified and counted using odd primes p>=5. Twin-D-I ranks and non-ranks make up the set of positive integers. Regularities of non-ranks allow obtaining the number of twin-D-I ranks. It involves considerable cancellations so that the asymptotic form of its main term collapses to the expected form, but its coefficient depends on D.
Selberg sieve weights and sign changes of Kloosterman sums. II. Square-free moduli with at most four prime factors
本文证明对每个符号，存在大量（\\(\gg X/\log X\\)）至多四个素因子的无平方因子模\\(q\\)，其归一化Kloosterman和取该符号，方法结合Selberg筛与等分布及均方估计。
We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new sieve-propelled proof of Linnik's theorem on the least prime in an arithmetic progression in the case of the presence of exceptional zeros.
Let $k\geq 2$ and $\mathcal{P} (n) = (A_1 n + B_1 ) \cdots (A_k n + B_k)$ where all the $A_i, B_i$ are integers. Suppose that $\mathcal{P} (n)$ has no fixed prime divisors. For each choice of $k$ it is known that there exists an integer $\varrho_k$ such that $\mathcal{P} (n)$ has at most $\varrho_k$ prime factors infinitely often. We used a new weighted sieve set-up combined with a device called an $\varepsilon$-trick to improve the possible values of $\varrho_k$ for $k\geq 7$. As a by-product of our approach, we improve the conditional possible values of $\varrho_k$ for $k\geq 4$, assuming th…
A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd primes p>=5. Twin-4 ranks and non-ranks make up the set of odd numbers. Regularities of non-ranks allow gathering information on them to obtain a Legendre-type sum for the number of twin-4 ranks. Due to considerable cancellations in it, the asymptotic law of its main term has the expected form and magnitude of its coefficient.
Weighted sieves with switching
本文研究带切换原理的加权筛法，重点检测一个素数与至多三素因子乘积的组合，并改进Yang和Harman的丢番图逼近结果，证明在分布水平至少0.267时可找到(p, P_3)。
A prime sieve is an algorithm that finds the primes up to a bound $n$. We say that a prime sieve is incremental, if it can quickly determine if $n+1$ is prime after having found all primes up to $n$. We say a sieve is compact if it uses roughly $\sqrt{n}$ space or less. In this paper we present two new results: (1) We describe the rolling sieve, a practical, incremental prime sieve that takes $O(n\log\log n)$ time and $O(\sqrt{n}\log n)$ bits of space, and (2) We show how to modify the sieve of Atkin and Bernstein (2004) to obtain a sieve that is simultaneously sublinear, compact, and incremen…
A modification of the linear sieve, and the count of twin primes
本文提出一种满足强分解性质的线性筛法修改，将素数分布水平提升至 $x^{10/17}$，超越以往工作，并据此获得孪生素数计数新上界，实现自1986年以来最大改进。
For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert αn + β\rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In addition, we also establish an asymptotic formula with an additional square-free condition on $n$. Moreover, if $α$ is quadratic irrational then the asymptotic formulas holds for all sufficiently large $x$. Our ingredients come from the Harman sieve which we adapt suitably to sieve for $[y,z]$-smooth numbers. The arithmetic information comes from estimates for exponential s…
Heuristic Bounded Prime Gaps via a Chaotic Multidimensional Sieve and Random Matrix Theory
本文提出融合混沌扰动与RMT的EMCHS概率筛框架，在GPY与Maynard筛法基础上启发式改进素数间隙界，并用数值证据与部分严格证明加以支撑。
Primes with a missing digit: distribution in arithmetic progressions and an application in sieve theory
本文利用圆法证明了缺失一位数字的素数的Bombieri-Vinogradov型定理，并结合半线性筛，给出了形如p=1+m^2+n^2的此类素数数量的正确数量级上下界。
Almost primes and primes that are sums of two squares plus 1
该研究用向量筛框架（含半线性筛、线性筛）得出满足p-1为两平方和且p+2素因子个数有界的素数p≤x的下界。
In this paper we study the distribution of squares modulo a square-free number $q$. We also look at inverse questions for the large sieve in the distribution aspect and we make improvements on existing results on the distribution of $s$-tuples of reduced residues.
We establish an asymptotic formula for the number of k-difference twin primes associated with the Hawkins random sieve, which is a probabilistic model of the Eratosthenes sieve. The formula for k=1 was obtained by Wunderlich [Acta Arith. 26 (1974), 59--81]. We here extend this to k \geq 2 and generalize it to all l-tuples of Hawkins primes.
An elementary method for computing various prime sequences using the sequence of Farey sequences is described.
On prime-producing sieves and distribution of $αp-β$ mod $1$
本文改进了 Jia 的结果，证明存在无穷多个素数满足 $\| αp - β\| < p^{-28/87}$，并给出新的三元组 $(59/87, 28/87, 1/29)$，所需 Type-II 信息量最少。
Primes in arithmetic progressions to large moduli and refinements of Harman's sieve
利用多作者算术信息与Harman筛法变体，构造素数指示函数的上下界，得到模数达x^{9/17}的双线性形式和模数达x^{17/32}的三线性形式的均值定理，并给出π(x;q,a)的几乎全部模数q的新上下界。
The method of proof of Balog and Ruzsa and the large sieve of Linnik are used to investigate the behaviour of the $L^{1}$ norm of a wide class of exponential sums over the square-free integers and the primes. Further, a new proof of the lower bound due to Vaughan for the $L^{1}$ norm of an exponential sum with the von Mangoldt $Λ$ function over the primes is furnished. Ramanujan's sum arises naturally in the proof, which also employs Linnik's large sieve.
The modified prime sieve for primitive elements in finite fields
本文针对有限域子集内本原元的存在性问题，提出仅依赖特征和估计的改进素数筛法判别准则，通过解决避开仿射超平面的相关问题验证了其实用性，相较已有研究实现显著改进。
An explicit version of Chen's theorem and the linear sieve
受Nathanson和Yamada工作启发，利用线性筛法证明大于$\exp(\exp(32.7))$的偶数均可表示为一个素数与至多两个素数乘积之和，给出了Chen定理的显式版本。
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of the proof is a probabilistic approach to the sieve method. In addition, we discuss their connections with recent work by Zhang and Maynard on small and large gaps in prime numbers.
On smooth gaps between primes using the Maynard-Tao sieve
本文利用 Zhang、Maynard 和 Polymath8b 在孪生素数猜想上的进展及 Maynard-Tao 筛法，将素数间光滑间隙的界限降低至 47，并证明存在无穷多个间隙均为 $y_m$-光滑的 $m$-元组素数。
Large sieve inequalities for exceptional Maass forms and the greatest prime factor of $n^2+1$
本文通过证明例外Maass形式的新型大型筛不等式，改进了n²+1的最大大素因子的下限，并应用于素数和光滑数在算术级数中的分布指数。
A new Combined Sieve algorithm is presented with cost proportional to the number of enumerated factors over a series of intervals. This algorithm achieves a significant speedup, over a traditional sieve, when handling many ([10^4, 10^7]) intervals concurrently. The speedup comes from a space-time tradeoff and a novel solution to a modular equation. In real world tests, this new algorithm regularly runs 10,000x faster. This faster sieve paired with higher sieving limits eliminates more composites and accelerates the search for large prime gaps by 30-70%. During the development and testing of th…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences are known as constellations. The populations of gaps and constellations across stages of Eratosthenes sieve are modeled exactly by discrete dynamic systems. These models and their asymptotic behaviors provide evidence on a number of open problems regarding gaps between prime numbers. For Eratosthenes sieve we show that the analogue of Polignac's conjecture is…
We derive explicit formulas for integrals of certain symmetric polynomials used in Keiju Sono's multidimensional sieve of $E_2$-numbers, i.e., integers which are products of two distinct primes. We use these computations to produce the currently best-known bounds for gaps between multiple $E_2$-numbers. For example, we show there are infinitely many occurrences of four $E_2$-numbers within a gap size of 94 unconditionally and within a gap size of 32 assuming the Elliott-Halberstam conjecture for primes and sifted $E_2$-numbers.
Let $L_1$, $L_2$ $L_3$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_1(n)L_2(n)L_3(n)$ has at most 7 prime factors, improving a result of Porter. We do this by means of a weighted sieve based upon the Diamond-Halberstam-Richert multidimensional sieve.
Let $A\subset [1,N]$ be a set of positive integers with $|A|\gg \sqrt N$. We show that if avoids about $p/2$ residue classes modulo $p$ for each prime $p$, the $A$ must correlate additively with the squares $S=\{n^2:1\leq n\leq \sqrt N\}$, in the sense that we have the additive energy estimate $E(A,S)\gg N\log N$. This is, in a sense, optimal.
We study an instance of the Affine Sieve, producing a level of distribution beyond that which can be obtained from current techniques, even assuming a Selberg/Ramanujan-type spectral gap. In particular, we consider the set of hypotenuses in a thin orbit of Pythagorean triples. Previous work [Kon07, Kon09, KO12] gave an exponent of distribution alpha < 1/12 coming from Gamburd's [Gam02] gap theta = 5/6, thereby producing R = 13 almost primes in this linear sieve problem (see Sec. 1 for definitions). If conditioned on a best possible gap theta = 1/2, the known method would give an exponent alpha…
Almost-primes in Sun's $x^2+ny^2$ conjecture
齐伟孙猜想中，通过加权筛法研究整数分解中同时为质数的条件，并证明了足够大的n具有几乎质数解。
$ $The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let $g^{\Box}(p)$ be the least square-free primitive root modulo $p$. We have proven the following two theorems. Theorem 0.1. $$g^{\Box}(p) < p^{0.88}\quad\text{for all primes }p.$$ Theorem 0.2. $$g^{\Box}(p) < p^{0.63093}\quad\text{for all primes } p < 2.5\times10^{15} \text{ and }p > 9.63\times10^{65}.$$ Theorem 0.1 shows an improvement in the best known bound while Theorem 0.2 shows for which primes we can prove the theoretical lower bound. After some introductory information in Chapter 1, we will …
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences are known as constellations. Over the last year we identified a discrete linear system that exactly models the population of any gap across all stages of the sieve. In August 2014 we summarized our results from analyzing this discrete model on populations of single gaps. This paper extends the discrete system to model the populations of constellations of gaps…
It is proven that there are infinitely prime pairs whose difference is no greater than 84. In proving that result, a new sieve weight is constructed. The new idea is to construct the largest sieve support which admits the use of the Bombieri-Vinogradov theorem.
We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens previous results of the first author in two aspects: the range of the moduli as well as the class of polynomials which can be handled. As a consequence, we deduce that there exist infinitely many primes $p$such that $p-1$ has a prime divisor of size $\gg p^{2/5+o(1)}$ that is the value of an incomplete norm form polynomial.
We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-ε}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and Iwaniec, who handled moduli of size at most $x^{4/7-ε}$. This has consequences for the level of distribution for sieve weights coming from the linear sieve.
On Chen's theorem, Goldbach's conjecture and almost prime twins II
本文证明了关于Goldbach猜想和孪生素数问题的筛法结果，将素数表示的下界渐近常数提升至1.9728，接近Hardy-Littlewood猜想的渐近常数2，结合了加权筛法、Chen转换原理等多种筛法技术。
The least prime with a given primitive root and a variant of the larger sieve
本文在广义黎曼猜想下，将给定原根的最小素数上界改进为对数三次方量级，并证明大筛法新变体，优于现有结果。
Carmichael numbers and the sieve
本文通过筛法证明存在无限多个Carmichael数，其素因子形式为$p = 1 + a^2 + b^2$。
Let $k\ge 2$ and $Π(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $Π(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $Ω(Π(n))\le r_k$ holds for some integer $r_k$ which is asymptotic to $k\log{k}$. We use a new kind of weighted sieve to improve the possible values of $r_k$ when $k\ge 4$.
Recently Oliver and Soundararajan made conjectures based on computational enumerations about the frequency of occurrence of pairs of last digits for consecutive primes. By studying Eratosthenes sieve, we have identified discrete dynamic systems that exactly model the populations of gaps across stages of Eratosthenes sieve. Our models provide some insight into the observed biases in the occurrences of last digits in consecutive primes, and the models suggest that the biases will ultimately be reversed for large enough primes. The exact model for populations of gaps across stages of Eratosthenes…
Strong divisibility sequences and sieve methods
本文利用筛法及除数闭集工具，研究强整除序列中含大素因子整数与素数项的密度界，并以 Fibonacci 数和椭圆整除序列为例分析方法局限。
We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic points and tails in the case of modulo a prime to the case of modulo a prime power.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。