Talk:Jordan-Pólya numbers: Difference between revisions

Talk:Jordan-Pólya numbers (view source)

182 bytes removed , 1 year ago

Undo revision 344754 by PureFox (talk) Scrub that last edit as it was working OK before.

9,487

edits

Revision as of 17:27, 11 June 2023 (view source) PureFox (talk \| contribs) (→‎Isn't that like N-smooth_numbers using n! instead of primes?: '439378587648000' now decomposing OK.) ← Older edit		Latest revision as of 17:38, 11 June 2023 (view source) PureFox (talk \| contribs) (Undo revision 344754 by PureFox (talk) Scrub that last edit as it was working OK before.) Tag: Undo
Line 10: :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!27 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) ~~::I just tried my latest ''Decompose'' function on 439378587648000 and it does now give: 14! x 7! --[[User:PureFox\|PureFox]] ([[User talk:PureFox\|talk]]) 17:27, 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)