The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 2201 – 2220 of 16591

Showing per page

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

Jean-Marie De Koninck, Nicolas Doyon, A. Arthur Bonkli Razafindrasoanaivolala, William Verreault (2020)

Archivum Mathematicum

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 .

Currently displaying 2201 – 2220 of 16591