On a divisor problem in arithmetic progressions
Let d(\(\ell,K;n)\) denote the number of divisors of n which are congruent to \(\ell (mod K)\), \(1\leq \ell \leq K\). Put \[ \sum_{n\leq x}d(\ell,K;n)=(x/K)\log x+(\gamma (\ell,K)+(1/K)(\gamma -1))x+\Delta (\ell,K;x) \] where \(\gamma\) denotes the Euler constant and \(\gamma (\ell,K)=\lim_{x\to \infty}(\sum_{n\leq x,n\equiv \ell (mod K)}1/n- (1/K)\log x).\) In this paper, the author observes that the ``discrete Hardy-Littlewood method may be applied to prove that \(\Delta (\ell,K;x)=O((x/K)^{\theta})\), for any \(\theta >7/22\), uniformly in \(\ell \leq K\leq x\) and the main result of the paper is a lower estimate for \(\Delta\) (\(\ell,K;x)\). This depends on the two roots \(\lambda_ 1\) and \(\lambda_ 2\), in the unit interval of the transcendental equation \(-Log(2 \sin \pi \lambda)+\pi \lambda -\lambda /2=0.\) Reviewer's remark: Recently \textit{H. Menzer} and the author considered a more general problem which appeared in Manuscr. Math. 64, No.1, 107-119 (1989; Zbl 0674.10037)].
- On an asymmetric divisor problem with congruence conditions
- Third power moments of the error terms corresponding to certain arithmetic functions
- Shifted Euler constants and a generalization of Euler-Stieltjes constants
- On a sum of divisors problem
- On the arcsine law on divisors in arithmetic progressions
- On the fourth power moment of the error term for the divisor problem with congruence conditions
- Divisors of Integers in Arithmetic Progression
- scientific article; zbMATH DE number 4079551 (Why is no real title available?)
- scientific article; zbMATH DE number 168488 (Why is no real title available?)
- scientific article; zbMATH DE number 1524418 (Why is no real title available?)
- Sur les processus arithmétiques liés aux diviseurs
- On higher-power moments of the error term for the divisor problem with congruence conditions
- scientific article; zbMATH DE number 3219076 (Why is no real title available?)
- The divisor problem for arithmetic progressions
- On the Piltz divisor problem with congruence conditions. II
- A two-sided omega-theorem for an asymmetric divisor problem
This page was built for publication: On a divisor problem in arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123924)