Integers without divisors from a fixed arithmetic progression
Authors:
- William D. BanksWBWilliam D. Banks
- John B. FriedlanderJFJohn B. Friedlander
- Florian LucaFLFlorian Luca
- 1 January 2008
- journal article
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 20 (6) , 1005-1037
Abstract
Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Repartition Des Diviseurs Dans Les Progressions ArithmetiquesBulletin of the London Mathematical Society, 2000
- Ensembles de multiples de suites finiesDiscrete Mathematics, 1999
- On some conjectures of Erdős in Astérisque, IJournal of Number Theory, 1992
- On the number of positive integers ≦ x and free of prime factors > yJournal of Number Theory, 1986
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- Proof of a conjecture about the distribution of divisors of integers in residue classesMathematical Proceedings of the Cambridge Philosophical Society, 1976
- Merten's theorem for arithmetic progressionsJournal of Number Theory, 1974
- Shorter Notes: On Some Products Involving PrimesProceedings of the American Mathematical Society, 1971
- Das asymptotische Verhalten von Summen ber multiplikative FunktionenMathematische Annalen, 1961