Primes between consecutive squares

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. The aim of this paper is to provide a bound for the exceptional set for this conjecture, unconditionally and under the assumption of some classical hypothesis. We also provide a conditional proof of the conjecture assuming an hypothesis about the behavior of Selberg's integral in short intervals.     

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.     

A game with divisors and absolute differences of exponents

In this work, we discuss a number game that develops in a manner similar to that on which Gilbreath's conjecture on iterated absolute differences between consecutive primes is formulated. In our case the action occurs at the exponent level and there, the evolution is reminiscent of that in a final Ducci game. We present features of the whole field of the game created by the successive generations, prove an analogue of Gilbreath's conjecture and raise some open questions.     

The Bateman–Horn conjecture: Heuristic,history, and applications

The Bateman–Horn conjecture is a far-reaching statement about the distribution of the prime numbers. It implies many known results, such as the prime number theorem and the Green–Tao theorem, along with many famous conjectures, such the twin prime conjecture and Landau’s conjecture. We discuss the Bateman–Horn conjecture, its applications, and its origins.     

关于连续素数上取值的Legendre符号和的估计

利用Karatsuba的方法,研究了关于连续素数上取值的Legendre符号和∑p≤N(p q)的估计问题,得到了当q0.75+ω相似文献   

On the representation of large integers as sums of four almost equal squares of primes

In this paper, we are able to establish two localized results on the conjecture that each large integer congruent to 4 modulo 24 can be written as the sum of four squares of primes. The proof is based on the new estimates for exponential sums over primes in short intervals and a technique to get the asymptotic formula on the enlarged major arcs in the circle method. This work is supported by the National Natural Science Foundation of China (Grant Nos. 10701048 and 10771127).     

The pair correlation of zeros of DirichletL-functions and primes in arithmetic progressions

We define a function which correlates the zeros of two DirichletL-functions to the modulusq and we prove an asymptotic estimate for averages of the pair correlation functions over all pairs of characters to (modq). An analogue of Montgomery’s pair correlation conjecture is formulated as to how this estimate can be extended to a greater domain for the parameters that are involved. Based on this conjecture we obtain results about the distribution of primes in an arithmetic progression (to a prime modulusq) and gaps between such primes.     

梅森素数研究的若干基本理论及其意义

梅森素数的研究历史源远流长,意义非凡.介绍相关的定义、理论及算法,归纳此项工作的意义,并讨论一些有待解决的相关数论问题.     

Almost Squares and Factorisations in Consecutive Integers

We show that there is no square other than 12² and 720² such that it can be written as a product of k–1 integers out of k(3) consecutive positive integers. We give an extension of a theorem of Sylvester that a product of k consecutive integers each greater than k is divisible by a prime exceeding k.     

Differences Between Consecutive Primes

Let p_n be the nth prime. Then this paper is concerned with provingthe following result on the distribution of consecutive primes. The exponent of x in this theorem improves on the work of Heath-Brownwho proved (1) with exponent . Under the Riemann hypothesisone can prove (1) with exponent .The proof of the theorem startswith the Heath-Brown–Linnik identity which leads to aformula giving the number of primes in an interval in termsof coefficients of certain Dirichlet series. I then estimatethe coefficients by using, among other things, the informationwhich can be gained from Montgomery's mean value theorem andHuxley's version of the Hal' asz lemma. Furthermore, by usingfamiliar sieve arguments I am able to discard some of the coefficientsallowing us to gain an improvement over the previous resultof Heath-Brown. 1991 Mathematics Subject Classification: 11N05.     

Are there arbitrarily long arithmetic progressions in the sequence of twin primes? II

In an earlier work it was shown that the Elliott-Halberstam conjecture implies the existence of infinitely many gaps of size at most 16 between consecutive primes. In the present work we show that assuming similar conditions not just for the primes but for functions involving both the primes and the Liouville function, we can assure not only the infinitude of twin primes but also the existence of arbitrarily long arithmetic progressions in the sequence of twin primes. An interesting new feature of the work is that the needed admissible distribution level for these functions is just 3/4 in contrast to the Elliott-Halberstam conjecture.     

Some Siegel modular standard L-values, and Shafarevich-Tate groups

We explain how the Bloch-Kato conjecture leads us to the following conclusion: a large prime dividing a critical value of the L-function of a classical Hecke eigenform f of level 1, should often also divide certain ratios of critical values for the standard L-function of a related genus two (and in general vector-valued) Hecke eigenform F. The relation between f and F (Harder?s conjecture in the vector-valued case) is a congruence involving Hecke eigenvalues, modulo the large prime. In the scalar-valued case we prove the divisibility, subject to weak conditions. In two instances in the vector-valued case, we confirm the divisibility using elaborate computations involving special differential operators. These computations do not depend for their validity on any unproved conjecture.     

Integral Domains Having Nonzero Elements with Infinitely Many Prime Divisors

In a factorial domain, every nonzero element has only finitely many prime divisors. We study integral domains having nonzero elements with infinitely many prime divisors.     

K-Theory of curves over number fields

We consider the algebraic K-groups with coefficients of smooth curves over number fields. We give a proof of the Quillen-Lichtenbaum conjecture at the prime 2 and prove explicit corank formulas for the algebraic K-groups with divisible coefficients. At odd primes these formulas assume the Bloch-Kato conjecture, at the prime 2 the formulas hold nonconjecturally.     

Ten consecutive primes in arithmetic progression

In 1967 the first set of 6 consecutive primes in arithmetic progression was found. In 1995 the first set of 7 consecutive primes in arithmetic progression was found. Between November, 1997 and March, 1998, we succeeded in finding sets of 8, 9 and 10 consecutive primes in arithmetic progression. This was made possible because of the increase in computer capability and availability, and the ability to obtain computational help via the Internet. Although it is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression, it is very likely that 10 primes will remain the record for a long time.

     

Gaps between integers with the same prime factors

We give numerical and theoretical evidence in support of the conjecture of Dressler that between any two positive integers having the same prime factors there is a prime. In particular, it is shown that the abc conjecture implies that the gap between two consecutive such numbers is , and it is shown that this lower bound is best possible. Dressler's conjecture is verified for values of and up to .

     

Entiers Lexicographiques

An integer n is called lexicographic if the increasing sequence of its divisors, regarded as words on the (finite) alphabet of the prime factors (arranged in increasing size), is ordered lexicographically. This concept easily yields to a new type of multiplicative structure for the exceptional set in the Maier-Tenenbaum theorem on the propinquity of divisors, which settled a well-known conjecture of Erdös. We provide asymptotic formulae for the number of lexicographic integers not exceeding a given limit, as well as for certain arithmetically weighted sums over the same set. These results are subsequently applied to establishing an Erdös-Kac theorem with remainder for the distribution of the number of prime factors over lexicographic integers. This provides quantitative estimates for lexicographical exceptions to Erdos' conjecture that also satisfy the Hardy-Ramanujan theorem.     

Well-behaved Beurling primes and integers

In this paper, we study generalised prime systems for which both the prime and integer counting functions are asymptotically well-behaved, in the sense that they are approximately li(x) and ρx, respectively (where ρ is a positive constant), with error terms of order O(x^θ₁) and O(x^θ₂) for some θ₁,θ₂<1. We show that it is impossible to have both θ₁ and θ₂ less than .     

关于Romanoff常数及其推广问题

1934年,Romanoff证明了：可表为一个素数和一个2的方幂之和的大奇数在全体正整数中具有正密度．本文证明了此密度大于0．09322,从而改进了该问题的已有结果0．0868．作为此问题的推广,本文还建立了一个类似的数值结果：可表为两个素数的平方和两个2的方幂之和的大偶数具有正密度．     

Homological symbols and the Quillen conjecture

We formulate a “correct” version of the Quillen conjecture on linear group homology for certain arithmetic rings and provide evidence for the new conjecture. In this way we predict that the linear group homology has a direct summand looking like an unstable form of Milnor K-theory and we call this new theory “homological symbols algebra”. As a byproduct, we prove the Quillen conjecture in homological degree two for the rank two and the prime 5.