arXiv Analytics

Sign in

arXiv:math/0604036 [math.NT]AbstractReferencesReviewsResources

Integers without divisors from a fixed arithmetic progression

William D. Banks, John B. Friedlander, Florian Luca

Published 2006-04-03Version 1

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.

Comments: 37 pages
Categories: math.NT
Subjects: 11A05, 11A25, 11N37
Related articles: Most relevant | Search more
arXiv:1110.6864 [math.NT] (Published 2011-10-31)
Asymptotics for numbers of line segments and lines in a square grid
arXiv:1007.0353 [math.NT] (Published 2010-07-02, updated 2010-09-10)
On the number of pairs of positive integers $x, y \le H$ such that $x^2 + y^2 + 1$ is squarefree
arXiv:0708.3552 [math.NT] (Published 2007-08-27)
An order result for the exponential divisor function

Links

Toolbox