Talk:Abundant odd numbers: Difference between revisions
→Abundant numbers: Added comment re abundant numbers.
(→Abundant numbers: added some comments about not being a duplicate task.) |
(→Abundant numbers: Added comment re abundant numbers.) |
||
Line 26:
:::: '''N''' is a ''nice number'' if the sum of its factors is <big> > </big> '''2×N'''
: This new definition would make the '''REXX''' programming example correct, and make the '''RING''' programming example as partly incorrect in that it doesn't list the final factor ('''N''' in the list of factors). -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:52, 16 May 2019 (UTC)
::Well, the Ring results correspond to the first 25 terms of [https://oeis.org/A005101 A005101] so I don't think there's much doubt that 'abundant' numbers are what CalmoSoft (who's not a native English speaker) had in mind even if he's calling them by an unfamiliar name and using the expression 'factors' rather than 'proper divisors'. Possibly 'nice' is a play on the name of the Greek mathematician, Nicomachus, who appears to have been the first to classify abundant numbers etc. circa 100 AD.
::Anyway, if this task is to be retained, perhaps we could make it a bit more interesting by asking for say the first 5 'odd' nice numbers to be calculated as well. I've added a tentative Go solution on this basis. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 13:00, 17 May 2019 (UTC)
| |||