Bounds for the counting function of the Jordan-P\'olya numbers
Abstract
A positive integer n is said to be a Jordan-P\'olya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-P\'olya numbers not exceeding a given number x.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.