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

DOI10.5817/AM2020-3-141MaRDI QIDQ5122207

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

Publication date: 22 September 2020

Published in: Archivum Mathematicum (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.09114

zbMATH Keywords

factorial functionfriable numbersJordan-Pólya numbers

Mathematics Subject Classification ID

Binomial coefficients; factorials; (q)-identities (11B65) Distribution of primes (11N05) Factorization; primality (11A51) Primes (11A41)

Cites Work

• Lower bounds for the greatest prime factor of product of consecutive positive integers
• Approximate formulas for some functions of prime numbers
• Stirling's Series Revisited
• On factorials which are products of factorials
• The n -th Prime is Greater than n logn
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for the counting function of the Jordan-Pólya numbers