paper

Bounds for the counting function of the Jordan-Pólya numbers

arXiv:2107.09114

Abstract

A positive integer 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 .

12 pages

References in corpus (1)

Bounds for the counting function of the Jordan-Pólya numbers · wovepaper