OurBigBook About$ Donate
 Sign in Sign up

Subpower bound for the divisor function (τ(n)≪η​nη(η>0))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Arithmetic function Divisor function
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For each η>0, the divisor function satisfies the displayed bound. Write n=∏pap​, so τ(n)=∏(ap​+1). For all sufficiently large primes, a+1≤2a≤pηa for every a≥0. For each of the finitely many smaller primes, supa≥0​(a+1)p−ηa is finite. Multiplying these finitely many constants proves the bound. Products of a fixed number of divisor functions obey the same conclusion after reducing η.

 Ancestors (6)

  1. Divisor function
  2. Arithmetic function
  3. Number theory
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (5)

  • Cubic eighth-moment proof by differencing
  • Cubic Weyl inequality
  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 76 / 1 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 30 / 5 / Solution
  • Weyl inequality

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook