Talk:Numbers which are the cube roots of the product of their proper divisors: Difference between revisions
Talk:Numbers which are the cube roots of the product of their proper divisors (view source)
Revision as of 16:05, 30 September 2022
, 1 year ago→Hint: Taking Rdm's hint...
mNo edit summary |
(→Hint: Taking Rdm's hint...) |
||
Line 2:
Currently one of the task implementations has the text "Whilst deceptively simple, the task reuires large integers as some of the divisor prioducts needed are large" -- but this is not actually the case, as the divisor products are not needed for this task. (Or at least the requirement for large integers is unnecessary -- I am agnostic about whether the task is deceptively simple.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 15:20, 30 September 2022 (UTC)
:Hi Rdm, Thanks for the hint. Before I posted the Algol 68 sample, I saw your comment that we just need to inspect the powers of the prime factors but at the time I didn't realise what you meant and not being au-fait with J, couldn't read your code to find out. However after googling stuff about cubes I now realise what you meant. I shall reword that comment.
:Considering that 41^3 is greater than 65535, I wasn't going to attempt the task in a 16 bit language but I think I will now... thanks. --[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 16:05, 30 September 2022 (UTC)
| |||