Results 1  10
of
10
ABC Implies No "Siegel Zeros" For LFunctions Of Characters With Negative Discriminant
 Inventiones Math
"... this paper we will apply the uniform abcconjecture to the very large solutions of Diophantine equations that arise from modular functions and deduce a lower bound for the class number of imaginary quadratic fields. This extends an idea of Chowla [1,2] who indicated, via a conjecture of Hall, how un ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
this paper we will apply the uniform abcconjecture to the very large solutions of Diophantine equations that arise from modular functions and deduce a lower bound for the class number of imaginary quadratic fields. This extends an idea of Chowla [1,2] who indicated, via a conjecture of Hall, how unlikely it is that
COMMON VALUES OF THE ARITHMETIC FUNCTIONS φ AND σ
"... ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s totient function and σ is the sumofdivisors function. This proves a 50year old conjecture of Erdős. Moreover, we show that there are infinitely many integers n such that φ(a) = n and σ(b) = n each ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s totient function and σ is the sumofdivisors function. This proves a 50year old conjecture of Erdős. Moreover, we show that there are infinitely many integers n such that φ(a) = n and σ(b) = n each have more than n c solutions, for some c> 0. The proofs rely on the recent work of the first two authors and Konyagin on the distribution of primes p for which a given prime divides some iterate of φ at p, and on a result of HeathBrown connecting the possible existence of Siegel zeros with the distribution of twin primes. 1.
SMALL GAPS BETWEEN PRIMES II (PRELIMINARY)
"... Abstract. We examine an idea for approximating prime tuples. 1. Statement of results (Preliminary) In the present work we will prove the following result. Let pn denote the nth prime. Then (pn+1 − pn) (1.1) lim inf n→ ∞ log pn(log log pn) −1 < ∞. log log log log pn Further we show that supposing ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We examine an idea for approximating prime tuples. 1. Statement of results (Preliminary) In the present work we will prove the following result. Let pn denote the nth prime. Then (pn+1 − pn) (1.1) lim inf n→ ∞ log pn(log log pn) −1 < ∞. log log log log pn Further we show that supposing the validity of the Bombieri–Vinogradov theorem up to Q ≤ Xϑ with any level ϑ>1/2 we have bounded differences between consecutive primes infinitely often: (1.2) lim inf n→ ∞ (pn+1 − pn) ≤ C(ϑ) with a constant C(ϑ) depending only on ϑ. If the Bombieri–Vinogradov theorem holds with a level ϑ>20/21, in particular if the Elliott–Halberstam conjecture holds, then we obtain (1.3) lim inf n→ ∞ (pn+1 − pn) ≤ 20, that is pn+1 − pn ≤ 20 for infinitely many n. Inequalities (1.2)–(1.3) will follow from the even stronger following result Theorem A. Suppose the Bombieri–Vinogradov theorem is true for Q ≤ Xϑ with some ϑ>1/2. Then there exists a constant C ′ (ϑ) such that any admissible ktuple contains at least two primes for any (1.4) k ≥ C ′ (ϑ) if ϑ>1/2, where C ′ (ϑ) is an explicitly calculable constant depending only on ϑ. Further we have at least two primes for (1.5) k =7 if ϑ>20/21. Remark. For the definition of admissibility see (2.2) below. We will show some more general results for the quantity (ν is a given positive integer) (1.6) Eν = lim inf n→∞ pn+ν − pn log pn
Uniform bounds for the least almostprime primitive root, submitted
"... A recurring theme in number theory is that multiplicative and additive properties of integers are more or less independent of each other, the classical result in this vein being Dirichlet’s theorem on primes in arithmetic progressions. Since the set of primitive roots to a given modulus is a union o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A recurring theme in number theory is that multiplicative and additive properties of integers are more or less independent of each other, the classical result in this vein being Dirichlet’s theorem on primes in arithmetic progressions. Since the set of primitive roots to a given modulus is a union of arithmetic progressions, it is natural to study the distribution of
Prime numbers and Lfunctions
"... Abstract. The classical memoir by Riemann on the zeta function was motivated by questions about the distribution of prime numbers. But there are important problems concerning prime numbers which cannot be addressed along these lines, for example the representation of primes by polynomials. In this t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The classical memoir by Riemann on the zeta function was motivated by questions about the distribution of prime numbers. But there are important problems concerning prime numbers which cannot be addressed along these lines, for example the representation of primes by polynomials. In this talk I will show a panorama of techniques, which modern analytic number theorists use in the study of prime numbers. Among these are sieve methods. I will explain how the primes are captured by adopting new axioms for sieve theory. I shall also discuss recent progress in traditional questions about primes, such as small gaps, and fundamental ones such as equidistribution in arithmetic progressions. However, my primary objective is to indicate the current directions in Prime Number Theory.
DUKE MATHEMATICAL JOURNAL Vol. 111, No. 3, c ○ 2002 SOME REMARKS ON LANDAUSIEGEL ZEROS
"... In this paper we show that, under the assumption that all the zeros of the Lfunctions under consideration are either real or lie on the critical line, one may considerably improve on the known results on LandauSiegel zeros. 1. ..."
Abstract
 Add to MetaCart
In this paper we show that, under the assumption that all the zeros of the Lfunctions under consideration are either real or lie on the critical line, one may considerably improve on the known results on LandauSiegel zeros. 1.
PRIMES IN TUPLES II
, 2007
"... We prove that liminf n→∞ pn+1 − pn √ log pn(log log pn) 2 where pn denotes the n th prime. Since on average pn+1 −pn is asymptotically log pn, this shows that we can always find pairs of primes much closer together than the average. We actually prove a more general result concerning the set of valu ..."
Abstract
 Add to MetaCart
We prove that liminf n→∞ pn+1 − pn √ log pn(log log pn) 2 where pn denotes the n th prime. Since on average pn+1 −pn is asymptotically log pn, this shows that we can always find pairs of primes much closer together than the average. We actually prove a more general result concerning the set of values taken on by the differences p − p′ between primes which includes the small gap result above.