Seven consecutive primes in arithmetic progression

It is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression. In 1967, the first such sequence of 6 consecutive primes in arithmetic progression was found. Searching for 7 consecutive primes in arithmetic progression is difficult because it is necessary that a prescribed set of at least 1254 numbers between the first and last prime all be composite. This article describes the search theory and methods, and lists the only known example of 7 consecutive primes in arithmetic progression.

     

Primes in arithmetic progressions with friable indices

We consider the numberπ(x,y;q,a)of primes p≤such that p≡a(mod q)and(p-a)/q is free of prime factors greater than y.Assuming a suitable form of Elliott-Halberstam conjecture,it is proved thatπ(x,y:q,a)is asymptotic to p(log(x/q)/log y)π(x)/φ(q)on average,subject to certain ranges of y and q,where p is the Dickman function.Moreover,unconditional upper bounds are also obtained via sieve methods.As a typical application,we may control more effectively the number of shifted primes with large prime factors.     

The exceptional set for the distribution of primes between consecutive powers

A well known conjecture about the distribution of primes asserts that between two consecutive squares there is always at least one prime number. The proof of this conjecture is quite out of reach at present, even under the assumption of the Riemann Hypothesis. This paper is concerned with the distribution of prime numbers between two consecutive powers of integers, as a natural generalization of the afore-mentioned conjecture.      

Asymptotic formulas for sequence factorial of arithmetic progression

This note provides asymptotic formulas for approximating the sequence factorial of members of a finite arithmetic progression by using Stirling, Burnside and other more accurate asymptotic formulas for large factorials that have appeared in the literature.     

算术数列中的素变数指数和问题

旨在应用初等方法研究指数和问题,给出了算术数列中素变数非线性指数和的一个上界估计.     

Short effective intervals containing primes in arithmetic progressions and the seven cubes problem

For any and any non-exceptional modulus , we prove that, for large enough ( ), the interval contains a prime in any of the arithmetic progressions modulo . We apply this result to establish that every integer larger than is a sum of seven cubes.

     

On a variance associated with the distribution of primes in arithmetic progressions

As is usual in prime number theory, write It is well known that when q is close to x the averagevalue of is about xlog q,and recently Friedlander and Goldston have shown that if then the first moment of V(x,q)-U(x,q)is small. In this memoir it is shown that the same is true forall moments. 2000 Mathematics Subject Classification: 11N13.     

Sifting for small primes from an arithmetic progression

In this work and its sister paper(Friedlander and Iwaniec(2023)),we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression.Using sieve machinery in both papers,we are able to dispensh with the log-free zero density bounds and the repulsion property of exceptional zeros,two deep innovations begun by Linnik and relied on in earlier proofs.     

Almost fifth powers in arithmetic progression

We prove that the product of k consecutive terms of a primitive arithmetic progression is never a perfect fifth power when 3?k?54. We also provide a more precise statement, concerning the case where the product is an “almost” fifth power. Our theorems yield considerable improvements and extensions, in the fifth power case, of recent results due to Gy?ry, Hajdu and Pintér. While the earlier results have been proved by classical (mainly algebraic number theoretical) methods, our proofs are based upon a new tool: we apply genus 2 curves and the Chabauty method (both the classical and the elliptic verison).     

算术数列中的素变数丢番图逼近

证明了:设λ1,λ2,λ3是非零实数,并且不同一符号,η是实数,λ1/λ2是无理数,h是一个给定的正整数,l1,l2,l3是整数,如果广义黎曼猜想成立,那么有无穷多有序素数对p1,p2,p3(pj≡lj(mod h),j=1,2,3)使得|λ1p1 λ2p2 λ3p3 η|＜(max pj)-(1)(10)(log max pj)5.     

Primes in Special Intervals and Additive Problems with Such Numbers

We study primes in a special set E which is naturally described by the fractional part of p^a, where a<1 is a noninteger. An asymptotic formula with power lowering in the remainder of the trigonometric sum over primes from the set E is obtained. We study several applications of this result to problems of the distribution of primes from E in arithmetic progressions and to additive problems with primes from E.     

On the ternary goldbach problem with primes in independent arithmetic progressions

We show that for every fixed A > 0 and θ > 0 there is a ϑ = ϑ(A, θ) > 0 with the following property. Let n be odd and sufficiently large, and let Q ₁ = Q ₂:= n ^1/2(log n)^−ϑ and Q ₃:= (log n) ^θ . Then for all q ₃ ≦ Q ₃, all reduced residues a ₃ mod q ₃, almost all q ₂ ≦ Q ₂, all admissible residues a ₂ mod q ₂, almost all q ₁ ≦ Q ₁ and all admissible residues a ₁ mod q ₁, there exists a representation n = p ₁ + p ₂ + p ₃ with primes p _i ≡ a _i (q _i ), i = 1, 2, 3.      

Small solutions of quadratic equations with prime variables in arithmetic progressions

A necessary and sufficient solvable condition for diagonal quadratic equation with prime variables in arithmetic progressions is given, and the best qualitative bound for small solutions of the equation is obtained,     

A search for Wieferich and Wilson primes

An odd prime is called a Wieferich prime if

alternatively, a Wilson prime if

To date, the only known Wieferich primes are and , while the only known Wilson primes are , and . We report that there exist no new Wieferich primes , and no new Wilson primes . It is elementary that both defining congruences above hold merely (mod ), and it is sometimes estimated on heuristic grounds that the ``probability" that is Wieferich (independently: that is Wilson) is about . We provide some statistical data relevant to occurrences of small values of the pertinent Fermat and Wilson quotients (mod ).

     

On the density of integers of the form 2 k + p in arithmetic progressions

Consider all the arithmetic progressions of odd numbers, no term of which is of the form 2^k ＋ p, where k is a positive integer and p is an odd prime. ErdSs ever asked whether all these progressions can be obtained from covering congruences. In this paper, we characterize all arithmetic progressions in which there are positive proportion natural numbers that can be expressed in the form 2^k ＋ p, and give a quantitative form of Romanoff＇s theorem on arithmetic progressions. As a corollary, we prove that the answer to the above Erdos problem is affirmative.     

Relative arithmetic

In nonstandard mathematics, the predicate ‘x is standard’ is fundamental. Recently, ‘relative’ or ‘stratified’ nonstandard theories have been developed in which this predicate is replaced with ‘x is y ‐standard’. Thus, objects are not (non)standard in an absolute sense, but (non)standard relative to other objects and there is a whole stratified universe of ‘levels’ or ‘degrees’ of standardness. Here, we study stratified nonstandard arithmetic and the related transfer principle. Using the latter, we obtain the ‘reduction theorem’ which states that arithmetical formulas can be reduced to equivalent bounded formulas. Surprisingly, the reduction theorem is also equivalent to the transfer principle. As applications, we obtain a truth definition for arithmetical sentences and we formalize Nelson's notion of impredicativity (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the product of consecutive elements of an arithmetic progression

A product ofkk ₀ (d) consecutive members of an arithmetic progression of differenced cannot be a proper power.     

Exponential sums over primes in short intervals

In this paper we establish one new estimate on exponential sums over primes in short intervals. As an application of this result, we sharpen Hua's result by proving that each sufficiently large integer N congruent to 5 modulo 24 can be written as N = p12 p22 p32 p42 p52, with |pj-(N/5)~(1/2)|≤U = N1/2-1/20 ε, where pj are primes. This result is as good as what one can obtain from the generalized Riemann hypothesis.