Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Sum of divisors

From Encyclopedia of Mathematics - Reading time: 1 min

2020 Mathematics Subject Classification: Primary: 11A25 Secondary: 11A51 [MSN][ZBL]

of a natural number n

The sum of the positive integers divisors of a natural number n, including 1 and n: σ(n)=d|nd . More generally, the function σk is defined as σk(n)=d|ndk . so that σ=σ1 and the number of divisors function τ=σ0.

These are multiplicative arithmetic functions with Dirichlet series n=1σk(n)ns=p((1ps)(1pks))1=ζ(s)ζ(sk) .

The average order of σ(n) is given by nxσ(n)=π212x2+O(xlogx) .

There are a number of well-known classes of number characterised by their divisor sums.

A perfect number n is the sum of its aliquot divisors (those divisors other than n itself), so σ(n)=2n. The even perfect numbers are characterised in terms of Mersenne primes P=2p1 as n=2p1.P: it is not known if there are any odd perfect numbers. An almost perfect number n similarly has the property that σ(n)=2n1: these include the powers of 2. A quasiperfect number is defined by σ(n)=2n+1: it is not known if any exists. See also Descartes number.

References[edit]

  • Kishore, Masao. "On odd perfect, quasiperfect, and odd almost perfect numbers". Mathematics of Computation 36 (1981) 583–586. Zbl 0472.10007
  • G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Cambridge Studies in Advanced Mathematics 46, Cambridge University Press (1995) ISBN 0-521-41261-7 Zbl 0831.11001

How to Cite This Entry: Sum of divisors (Encyclopedia of Mathematics) | Licensed under CC BY-SA 3.0. Source: https://encyclopediaofmath.org/wiki/Sum_of_divisors
10 views |
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF