Talk:Multiplicatively perfect numbers: Difference between revisions
Content added Content deleted
Line 12: | Line 12: | ||
::I am in favor of deleting this task, the example code is completly wrong. --[[User:Frisian|Frisian]] ([[User talk:Frisian|talk]]) 01:31, 18 April 2023 (UTC) |
::I am in favor of deleting this task, the example code is completly wrong. --[[User:Frisian|Frisian]] ([[User talk:Frisian|talk]]) 01:31, 18 April 2023 (UTC) |
||
:: agree this is a duplicate task as currently defined. --[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 01:46, 18 April 2023 (UTC) |
Revision as of 01:46, 18 April 2023
I put up an example that fits the Wren code, but then noted its result is very different from the Ring result. Is there a problem with the Ring code or the definition of special?
- Assuming the definition is correct, then the Ring solution is not consistent with it. Take the case of n = 64, for example. 16 and 32 are also divisors but he hasn't included them in the product.--PureFox (talk) 20:12, 17 April 2023 (UTC)
- Incidentally, as the definition stands, I don't think '1' should be included as a 'special number' because it has no eligible divisors. However, it is a 'multiplicatively perfect number' because the product of its divisors (namely 1) is equal to 1 x 1. --PureFox (talk) 20:27, 17 April 2023 (UTC)
Vote for deletion
Duplicate of Semiprime except misnamed, poor task description, and incomprehensible example code. Delete. --Thundergnat (talk) 22:52, 17 April 2023 (UTC)
- Hadn't noticed it before but, yes, it is effectively a duplicate of the Semiprime task, at least for this range of numbers. So I'd second the vote for deletion. --PureFox (talk) 23:17, 17 April 2023 (UTC)