The least square-free number in an arithmetic progression.

DOI10.1515/crll.1982.332.204zbMath0493.10045OpenAlexW4254792523MaRDI QIDQ3955453

D. R. Heath-Brown

Publication date: 1982

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002199459

zbMATH Keywords

upper boundscharacter sumsalmost primessquare-free integer in arithmetic progression

Mathematics Subject Classification ID

Estimates on character sums (11L40) Primes in congruence classes (11N13) Distribution of primes (11N05)

Related Items

ON THE LEAST SQUAREFREE NUMBER IN AN ARITHMETIC PROGRESSION ⋮ Bilinear forms with exponential sums with binomials ⋮ Bounds of some double exponential sums ⋮ Diophantine equations and congruences over function fields ⋮ On sums of Kloosterman and Gauss sums ⋮ On smooth square‐free numbers in arithmetic progressions ⋮ Automaticity. IV: Sequences, sets, and diversity ⋮ Unnamed Item ⋮ Burgess bounds for multi-dimensional short mixed character sums ⋮ Large gaps between consecutive prime numbers containing square-free numbers and perfect powers of prime numbers ⋮ Bounds on average values of double incomplete Kloosterman sums ⋮ A bound for the 3-part of class numbers of quadratic fields by means of the square sieve ⋮ Sums of inverses in thin sets of finite fields ⋮ Circuit and decision tree complexity of some number theoretic problems ⋮ Application of a method of Szemeredi