Integers without divisors in a given progression (Q639944): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00605-010-0212-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1993278349 / rank | |||
Normal rank |
Revision as of 23:36, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Integers without divisors in a given progression |
scientific article |
Statements
Integers without divisors in a given progression (English)
0 references
11 October 2011
0 references
If follows from a result of Landau of 1909 that for any given integer \(q>2\), the number of positive integers \(n\leq x\) such that \(n\) has no prime factor congruent to \(1\pmod q\) is asymptotically equal to \(c(q)x/(\log x)^{1-1/\phi(q)}\) as \(x\) tends to infinity, with some well-understood positive constant \(c(q)\). Recently, Banks, Friedlander and the reviewer fixed an odd prime \(q\) and a residue class \(a\) coprime to \(q\) and considered the problem of estimating the number of \(n\leq x\) such that \(n\) has no divisor \(d>1\) in the congruence class \(a\pmod q\). They established that the number of such \(n\) is asymptotically equal to \(cx(\log\log x)^{\alpha}/(\log x)^{\beta}\) as \(x\) tends to infinity, with well-determined constants \(c>0,~\alpha\geq 0,~0<\beta\leq 1\) depending on \(a\) and \(q\). When \(a=1\), these constants are \(\alpha=q-3,~\beta=1\) and \(c=\frac{q\phi(q-1)}{(q-1)^{q-1)} (q-3)!}\). The purpose of the paper under review is two fold. Firstly, the authors show how one can simplify the somewhat ad-hoc analytical part of the argument due to Banks et. al. by using an approach used by Delange in several problems. Secondly, this more general approach allows the authors to deduce that similar estimates hold true when \(q\geq 3\) is an arbitrary modulus, not necessarily prime, but retaining the condition that \(a\) is coprime to \(q\). In this case, the values of the constants \(\alpha, ~\beta\) and \(c\) are more complicated since they depend on certain combinatorial constants associated to finite abelian groups. The approach is in fact even more general and also works to count integers \(n\leq x\) having no divisors \(d>1\) in a certain set of \(k\geq 2\) residue classes comprise to their modulus's, although in this later case the determination of \(\alpha,~\beta\) and \(c\) remains unachieved. It is likely that this nice paper will spur future research especially concerning the exact determination of the parameters \(\alpha,~\beta\) and \(c\) either in general or in interesting instances.
0 references
asymptotic results on arithmetic functions
0 references