The divisor function in arithmetic progressions modulo prime powers

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We study the average value of the divisor function τ(n)for n≤x with n≡a mod q. The divisor function is known to be evenly distributed over arithmetic progressions for all q that are a little smaller than x2/3. We show how to go past this barrier when q=pk for odd primes p and any fixed integer k≥7.

Original languageEnglish
Pages (from-to)898-908
Number of pages11
JournalMathematika
Volume62
Issue number3
DOIs
Publication statusPublished - 2016

Fingerprint

Divisor Function
Arithmetic sequence
Modulo
Odd
Integer

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

The divisor function in arithmetic progressions modulo prime powers. / Khan, Rizwanur.

In: Mathematika, Vol. 62, No. 3, 2016, p. 898-908.

Research output: Contribution to journalArticle

@article{6a6365b18d634052a27fba94ec893226,
title = "The divisor function in arithmetic progressions modulo prime powers",
abstract = "We study the average value of the divisor function τ(n)for n≤x with n≡a mod q. The divisor function is known to be evenly distributed over arithmetic progressions for all q that are a little smaller than x2/3. We show how to go past this barrier when q=pk for odd primes p and any fixed integer k≥7.",
author = "Rizwanur Khan",
year = "2016",
doi = "10.1112/S0025579316000024",
language = "English",
volume = "62",
pages = "898--908",
journal = "Mathematika",
issn = "0025-5793",
publisher = "University College London",
number = "3",

}

TY - JOUR

T1 - The divisor function in arithmetic progressions modulo prime powers

AU - Khan, Rizwanur

PY - 2016

Y1 - 2016

N2 - We study the average value of the divisor function τ(n)for n≤x with n≡a mod q. The divisor function is known to be evenly distributed over arithmetic progressions for all q that are a little smaller than x2/3. We show how to go past this barrier when q=pk for odd primes p and any fixed integer k≥7.

AB - We study the average value of the divisor function τ(n)for n≤x with n≡a mod q. The divisor function is known to be evenly distributed over arithmetic progressions for all q that are a little smaller than x2/3. We show how to go past this barrier when q=pk for odd primes p and any fixed integer k≥7.

UR - http://www.scopus.com/inward/record.url?scp=84978997375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84978997375&partnerID=8YFLogxK

U2 - 10.1112/S0025579316000024

DO - 10.1112/S0025579316000024

M3 - Article

VL - 62

SP - 898

EP - 908

JO - Mathematika

JF - Mathematika

SN - 0025-5793

IS - 3

ER -