Revision as of 18:45, 4 May 2021 edit Citation bot (talk \| contribs) Bots 5,870,769 edits Add: s2cid. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox \| #UCB_webform_linked 242/999 ← Previous edit		Revision as of 18:18, 30 May 2021 edit undo Of the universe (talk \| contribs) Extended confirmed users 2,644 edits m →Formulas at prime powers: why template Tag: Visual edit Next edit →
Line 177: Clearly, <math>1 < \sigma_0(n) < n</math> and σ(''n'') > ''n'' for all ''n'' > 2. The divisor function is [[multiplicative function\|multiplicative]],{{Why\|date=May 2021\|reason=the divisor function doesn't seem obviously multiplicative. What is the proof sketch?}} but not [[Completely multiplicative function\|completely multiplicative]]: :<math>\gcd(a, b)=1 \Longrightarrow \sigma_x(ab)=\sigma_x(a)\sigma_x(b).</math>

Divisor function: Difference between revisions