Talk:Sum of divisors

already here as "Proper divisors" ?

...   (Replying to non-existent text that wasn't included here when this talk section was created   ---   first time I ever saw a talk section created without any content (text) in it,   it's rather awkward to discuss a topic without any content, per se)         I also changed the talk section name by adding a question mark.

So,   I don't believe that the above mentioned task   Proper divisors   is already here as a task by another name.

The Rosetta Code task   Proper divisors   required:

•   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.     This task  (Sum of divisors)   is different enough to warrant it's own Rosetta Code task.   -- Gerard Schildberger (talk) 16:48, 20 December 2020 (UTC)

I saw that page but really, this one includes n itself, it is the one the most needed and there are many formulas to do it. --Blek

Perhaps that phrase the one the most needed expresses a slight misunderstanding about the nature and goals of Rosetta Code ?

You will see, on the landing page, that Rosetta aims for contrastive insight – not for comprehensive coverage of homework questions :-) The scope for contrastive insight in the matter of divisors is already exhausted by the trivially different Proper divisors task. Hout (talk) 17:50, 20 December 2020 (UTC)