Large values of the number of factorizations of an integer as an ordered product of primes
From MaRDI portal
Publication:926490
DOI10.1007/s11139-007-9028-6zbMath1195.11130MaRDI QIDQ926490
Mohand-Ouamar Hernane, Jean Louis Nicolas
Publication date: 20 May 2008
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-007-9028-6
11N37: Asymptotic results on arithmetic functions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Asymptotic results for partitions (I) and the distribution of certain integers
- On highly factorable numbers
- Factorisatio numerorum with constraints
- An asymptotic formula for extended Eulerian numbers
- Approximate formulas for some functions of prime numbers
- On some asymptotic formulas in the theory of the ``factorisatio numerorum
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
- On Product Partitions of Integers
- "Factorisatio numerorum" in arithmetical semigroups
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Prime numbers and computer methods for factorization