Content deleted Content added
RedstoneDave (talk | contribs) →Formulas at prime powers: a sketch of proof |
→Definition: it is weird to use x as subscript / exponent. Any serious number theorist would use rather k. Now I get that author wants to hint that it's not required to be integer... Maybe we can use z? |
||
Line 11:
==Definition==
The '''sum of positive divisors function''' σ<sub>''
:<math>\
where <math>{d\mid n}</math> is shorthand for "''d'' [[divides]] ''n''".
The notations ''d''(''n''), ν(''n'') and τ(''n'') (for the German ''Teiler'' = divisors) are also used to denote σ<sub>0</sub>(''n''), or the '''number-of-divisors function'''<ref name="Long 1972 46">{{harvtxt|Long|1972|p=46}}</ref><ref>{{harvtxt|Pettofrezzo|Byrkit|1970|p=63}}</ref> ({{OEIS2C|id=A000005}}). When ''
The '''[[aliquot sum]]''' ''s''(''n'') of ''n'' is the sum of the [[proper divisor]]s (that is, the divisors excluding ''n'' itself, {{OEIS2C|id=A001065}}), and equals σ<sub>1</sub>(''n'') − ''n''; the [[aliquot sequence]] of ''n'' is formed by repeatedly applying the aliquot sum function.
|