Talk:Jordan-Pólya numbers: Difference between revisions
m
→Isn't that like N-smooth_numbers using n! instead of primes?
Line 8:
: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
== Factoring the 1050th number ==
| |||