Sieving Very Thin Sets of Primes, and Pratt Trees with Missing Primes

DOI10.1093/IMRN/RNT026zbMATH Open1318.11116arXiv1212.3498OpenAlexW2963230193MaRDI QIDQ2935152FDOQ2935152

Authors: Kevin Ford 

Publication date: 22 December 2014

Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Abstract: Suppose P is a set of primes, such that for every p in P, every prime factor of p-1 is also in P. If P does not contain all primes, we apply a new sieve method to show that the counting function of P is O(x^{1-c}) for some c>0, where c depends only on the smallest prime not in P. Our proof makes use of results connected with Artin's primitive root conjecture.

Full work available at URL: https://arxiv.org/abs/1212.3498

Recommendations

• The number of maximum primitive sets of integers
• On Minimal Sets of Generators for Primitive Roots
• On the number of primitive λ-roots
• On prime primitive roots
• The counting version of a problem of Erdős
• scientific article; zbMATH DE number 572155
• Arithmetic progressions of primitive roots of a prime. III.
• Some Remarks on Artin's Conjecture
• Sums over primitive sets with a fixed number of prime factors
• On a conjecture of Erdős on the sum \(\sum_{p\leq n}1/(p\,\log \,p)\)

zbMATH Keywords

primessieve methodsArtin's primitive root conjecturePerron Frobenius theorem

Mathematics Subject Classification ID

Distribution of primes (11N05) Applications of sieve methods (11N36)

Cited In (2)

• Prime chains and Pratt trees
• Title not available (Why is that?)

This page was built for publication: Sieving Very Thin Sets of Primes, and Pratt Trees with Missing Primes

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