On the upper bound for the number of primes or almost primes in a given integer sequence

DOI10.1007/BF02309110MaRDI QIDQ4012806zbMATH OpenOpenAlexFDO

Authors Jiahai Kan

Publication date 27 September 1992

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02309110

zbMATH Keywords

upper boundsinteger sequencesievesalmost primesnumber of primes

Mathematics Subject Classification ID

Distribution of primes (11N05) Distribution of integers with specified multiplicative constraints (11N25) Applications of sieve methods (11N36)

Recommendations

• On the upper bound of the number of primes in arithmetic progression
• scientific article; zbMATH DE number 4146034
• scientific article; zbMATH DE number 2207306
• Explicit bounds for primes in arithmetic progressions
• On the exact number of primes less than a given limit
• scientific article; zbMATH DE number 3171223
• On the Exact Number of Primes Below a Given Limit

Cited in

(3)

• On upper bounds for the count of elite primes
• Upper bound of \(\sum 1/(a_i \log a_i)\) for quasi-primitive sequences
• Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis

This page was built for publication: On the upper bound for the number of primes or almost primes in a given integer sequence

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