OurBigBook About$ Donate
 Sign in Sign up

Divisor function (τ(n))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Arithmetic function
Created 2026-09-24 Updated 2026-09-24  1 By others on same topic  0 Discussions Create my own version
The divisor function τ(n)=∑d∣n​1 counts the positive integer divisors of n.

 Ancestors (5)

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

 Incoming links (1)

  • Dirichlet hyperbola method

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Divisor function by Wikipedia Bot  1
 View more
The divisor function, often denoted as \( d(n) \) or \( \sigma_k(n) \), is a function in number theory that counts or sums the divisors of a positive integer \( n \). 1. **Count of Divisors**: The most common version is \( d(n) \), which counts the total number of positive divisors of \( n \).
 Read the full article
  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