On a conjecture of Pomerance

DOI10.4064/AA155-2-5MaRDI QIDQ2919678zbMATH OpenOpenAlexWikidataFDO

Authors N. Saradha, Lajos Hajdu, R. Tijdeman

Publication date 5 October 2012

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.5191, http://hdl.handle.net/2437/150143

zbMATH Keywords

primes in residue classesRiemann hypothesis

Mathematics Subject Classification ID

Primes in congruence classes (11N13)

Abstract: We say that k is a P-integer if the first phi(k) primes coprime to k form a reduced residue system modulo k. In 1980 Pomerance proved the finiteness of the set of P-integers and conjectured that 30 is the largest P-integer. We prove the conjecture assuming the Riemann Hypothesis. We further prove that there is no P-integer between 30 and 10^11 and none above 10^3500.

Review text

The authors study the so called P-integers; recalling that (the Euler function) NEWLINE\[NEWLINE \varphi(n):=|\{ j\leq n, (j,n)=1\}| NEWLINE\]NEWLINE is the number of positive integers up to \(n\), coprime to \(n\), then we say that \(k\) is a P-integer, by definition, if the first \(\varphi(k)\) primes coprime to \(k\) form a reduced residue system modulo \(k\). \textit{C. Pomerance} proved in [J. Number Theory 12, 218--223 (1980; Zbl 0436.10020)] the finiteness of P-integers and made theNEWLINENEWLINENEWLINEConjecture. The largest P-integer is 30.NEWLINENEWLINENEWLINEUnder RH, Riemann Hypothesis, i.e., all the complex zeros of the Riemann \(\zeta\) function, defined in \(\text{Re}(s)>1\) as NEWLINE\[NEWLINE \zeta(s):=\sum_{n=1}^{\infty}n^{-s}, NEWLINE\]NEWLINE have real part equal to \(1/2\), the authors prove Pomerance's Conjecture (and even more, see Theorem 1.2). Also, relying on previous properties of P-integers proved by two of them (see quoted publications in the paper), They are able to find some numerical ranges in which they prove there are no P-integers (esp., all of them have to be less than \(10^{3500}\), see Theorem 1.1).NEWLINENEWLINEAs the authors point out, ``Pomerance's conjecture is closely related to the classical problem about the least primes in arithmetic progressions.NEWLINENEWLINEFor the proofs, as they say ``We use the fact that the primitive residues modulo \(k\) between \(0\) and \(k\) are symmetric around \(k=2\). Our arguments are based on results about the zeros of the Riemann zeta function and estimates for the number of primes in intervals.NEWLINENEWLINEActually, they need very precise constants in the remainders and this is performed both by a careful estimate applying well-known results and by computer aided calculations (by Maple).

Recommendations

• Proof of the P-integer conjecture of Pomerance
• On a conjecture of R. L. Graham
• Conjecture of Pomerance for some even integers and odd primorials
• On a problem of Recaman and its generalization
• Integers without large prime factors in short intervals: conditional results

Cited in

(6)

• Explicit zero-free regions for Dirichlet L-functions
• Proof of the P-integer conjecture of Pomerance
• On the regularity of primes in arithmetic progressions
• Updating the error term in the prime number theorem
• On a problem of Recaman and its generalization
• On generalizations of problems of Recaman and Pomerance

Describes a project that uses

Uses Software

• Maple

This page was built for publication: On a conjecture of Pomerance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2919678)