1

I am trying to understand the dynamics of the aliquot sum.

I am wondering if a recurrence relation exists?

For example, would this work:

  • Let $s(x)$ be the aliquot sum for $x$
  • Let $p$ be a prime
  • If $x$ is $1$, then $s(x)=0$
  • If $x$ is prime, then $s(x)=1$
  • If $p \nmid x$, then $s(px) = s(x) + ps(x) + x$
  • If $p | x$, then $s(px) = s(x) + x$

Thanks.


Edit: Made updates based on comments received by Mason.

Larry Freeman
  • 10,189

1 Answers1

2

Define $f(x)+x=\sigma(x)=\sum_{d|x}d$. Then $f(x)$ is our aliquot function.

For coprime numbers $a,b$ Then $\sigma(a b)= \sigma(a)\sigma(b) $ so

$f(ab)+ab=(f(a)+a)(f(b)+b)$

This implies that

$f(ab)= f(a)f(b)+bf(a)+af(b)$ for coprime $a,b$.

While we're talking about recurrence we should mention this amazing recurrence formula from Euler that can be found here.

Mason
  • 4,489
  • and $p+q=2m$ so $2(p+q)=4m$ so they are alway different by a multiple of 4. –  Dec 03 '19 at 20:46
  • @RoddyMacPhee. I think your comment must have got cut off. – Mason Dec 04 '19 at 01:54
  • nope just relating in another unsolved problem. $$\varphi(n)+2(p+q) = \sigma_1(n)$$ with $p$ and $q$ prime is saying the difference ( admittedly in this case) is a multiple of 4 (see Goldbach). –  Dec 04 '19 at 03:21
  • Actually I think this write up is a better resource. A little clearer. – Mason Dec 05 '19 at 06:49