arXiv · 2107.09114
Bounds for the counting function of the Jordan-Pólya numbers
Abstract
A positive integer $n$ is said to be a Jordan-Pólya 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ólya numbers not exceeding a given number $x$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jean-Marie De Koninck, Nicolas Doyon, A. Arthur Bonkli Razafindrasoanaivolala, William Verreault. 2021-07-19. Bounds for the counting function of the Jordan-Pólya numbers. https://arxiv.org/abs/2107.09114
Cite the original work for its findings. Save a collection to share your selection of sources.