Integers without divisors from a fixed arithmetic progression
classification
🧮 math.NT
keywords
arithmeticintegersnumberprogressionasymptoticdivisordivisorsfind
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.