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 10:15, 1 October 2022
, 1 year agoFirst proper divisor products that won't fit in signed 32 and 64 bits...
(Comments on comments, hints and OEIS...) |
(First proper divisor products that won't fit in signed 32 and 64 bits...) |
||
Line 10:
:::Purefox, I noticed your comment on the newer Wren solution and checked the OEIS page and it does indeed say that the sequence is 1 and the numbers with 8 divisors! So it really is simple and divisor products, cubes, cube roopts etc. are not needed.
:::BTW, I didn't mean "deceptively simple" as an insult... It started out looking simple but when the magnitude of the divisor products became apparent, it started to look hard but (as with a lot of things) it is actually simple if you use the right technique (i.e. someone shows you a better approach). --[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 21:58, 30 September 2022 (UTC)
<br>
I ran a few tests...<br>
The first number whose proper divisor product won't fit in signed 32 bits is 84, with pdp 4182119424 (10 digits).<br>
The first number whose proper divisor product won't fit in signed 64 bits is 240, with pdp 2641807540224000000000 (22 digits).<br>
--[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 10:14, 1 October 2022 (UTC)
| |||