On the A-dependence of the linear sieve with application to polynomial sequences

DOI10.1016/0022-314X(86)90098-3zbMath0603.10045OpenAlexW2062253456MaRDI QIDQ1082368

Gerhard Bantle

Publication date: 1986

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-314x(86)90098-3

zbMATH Keywords

upper boundserror termslinear sievenumber of primes in polynomial sequences

Mathematics Subject Classification ID

Primes in congruence classes (11N13) Distribution of primes (11N05) Sieves (11N35)

Related Items (2)

AN EFFECTIVE ANALYTIC FORMULA FOR THE NUMBER OF DISTINCT IRREDUCIBLE FACTORS OF A POLYNOMIAL ⋮ Primes representable by polynomials and the lower bound of the least primes in arithmetic progressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rosser's sieve
• A new form of the error term in the linear sieve
• On the density of some sets of primes, II
• An improvement of Selberg's sieve method I

This page was built for publication: On the A-dependence of the linear sieve with application to polynomial sequences