Math 2.0

Number theory Definition

Sum of divisors

Builds on Divisor function

Definition

For a positive integer nn, the sum of divisors of nn is σ(n)=σ1(n)=∑d∣nd,\sigma(n) = \sigma_1(n) = \sum_{d \mid n} d, where σ1\sigma_1 is the divisor function with k=1k = 1.

Remarks

If n=p1e1⋯prern = p_1^{e_1} \cdots p_r^{e_r} with distinct primes pip_i, then σ(n)=∏i=1rpiei+1−1pi−1\sigma(n) = \prod_{i=1}^{r} \frac{p_i^{e_i + 1} - 1}{p_i - 1}. For example, σ(12)=1+2+3+4+6+12=28\sigma(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28. The sum of the proper divisors is σ(n)−n\sigma(n) - n. It defines perfect, abundant and deficient numbers.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Divisors of a natural number definition
  4. Divisor function definition
  5. Sum of divisors definition

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Divisor_function, Definition
About this page
Tag009QCP5T3Z
URIm2://009QCP5T3Z
Aliasessum-of-divisors-function
Kinddefinition
WritingW0 stub
MSC11A25
DefinesSum of divisors
UsesDivisor function

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by