Talk:Jordan-Pólya numbers

Isn't that like N-smooth_numbers using n! instead of primes?

In N-smooth numbers one can change p1..pn by 2! to n!
I think , only using 2!,3!,5!,..pn! is sufficient. 4! = (2!)^2*3!, 6! = 5!*3!... so no extra numbers will be created.

7213895789838336 =(4!)^8 * (2!)^16 == ((2!)^2 *(3!))^8 * (2!)^16 = (2!)^32*(3!)^8

Horst (talk) 08:48, 9 June 2023 (UTC)

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. --PureFox (talk) 09:57, 9 June 2023 (UTC)

Factoring the 1050th number

The 1050th jp number is 139,345,920,000. One and I suspect the only possible factorisation is 7! * 5!^3 * 2!^4, but the Phix/Julia/Wren entries are not getting that. I have thought of a better strategy, based on the prime powers, but it would naturally produce the lowest factorials - I think I might have just thought of a way to convert that to the highest factorials... --Petelomax (talk) 23:52, 9 June 2023 (UTC)