Integers without divisors from a fixed arithmetic progression
Number Theory
2007-05-23 v1
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.
Cite
@article{arxiv.math/0604036,
title = {Integers without divisors from a fixed arithmetic progression},
author = {William D. Banks and John B. Friedlander and Florian Luca},
journal= {arXiv preprint arXiv:math/0604036},
year = {2007}
}
Comments
37 pages