Talk:Sum of divisors

From Rosetta Code

already here as "Proper divisors"

...   (Replying to some text that wasn't included here when this talk section was created).

The Rosetta Code task   Proper divisors   asked

  •   write a routine to find (generate) all the proper divisors of an integer,
  •   display a list of the proper divisors for a list of numbers,   and
  •   find a number  (up to some limit)  that has the most proper divisors.


This Rosetta Code task is to   sum   the divisors     (divisors,   not   proper divisors).

There is (or can be) some overlap as there are minor differences between   divisors   and   proper divisors,   the case for unity being one of them.     -- Gerard Schildberger (talk) 16:48, 20 December 2020 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Sum_of_divisors?oldid=305813"