Integers without divisors from a fixed arithmetic progression

Simple item page
dc.creatorBanks, William D.
dc.creatorFriedlander, John B.
dc.creatorLuca, Florian
dc.date2006-04-03
dc.date.accessioned2026-07-07T07:10:26Z
dc.date.available2026-07-07T07:10:26Z
dc.descriptionLet 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.
dc.description37 pages
dc.identifierhttps://arxiv.org/abs/math/0604036
dc.identifierhttp://arxiv.org/abs/math/0604036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111422
dc.subjectNumber Theory
dc.subject11A05, 11A25, 11N37
dc.titleIntegers without divisors from a fixed arithmetic progression
dc.typetext

Files

Collections

arXiv