Talk:Jordan-Pólya numbers: Difference between revisions
m
A false estimate of me.
(→Factoring the 1050th number: Wren solutions now hopefully fixed.) |
m (A false estimate of me.) |
||
Line 9:
:There may, of course, be more than one way to decompose a J-P number into a product of factorials but the idea is to choose the way which uses the largest factorials and present these in highest to lowest order. I've added a sentence to the task description to try and clarify this. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 09:57, 9 June 2023 (UTC)
:I believe (bicbw) there is no way to make 439,378,587,648,000 = 14! * 7! with only prime factorials. --[[User:Petelomax|Petelomax]] ([[User talk:Petelomax|talk]]) 02:53, 10 June 2023 (UTC)
:Yes, your right.14! = 13!*2*7 2= 2! but no way to get a lonely 7. Of course there 16!= 2!^4 * 15! . To much work for to less advantage --[[User:Horst|Horst]] ([[User talk:Horst|talk]]) 16:28, 11 June 2023 (UTC)
== Factoring the 1050th number ==
The 1050th jp number is 139,345,920,000. It factors as 7! * 5!^3 * 2!^4 or 8! * 5!^3 * 2! but the <del>Phix</del>/Julia/Wren entries are not getting that. Update: new algorithm posted, however my faffing about with prime powers is probably not the point, one-at-a-time/less greedy probably is. --[[User:Petelomax|Petelomax]] ([[User talk:Petelomax|talk]]) 05:31, 10 June 2023 (UTC)
| |||