New upper bounds for the number of divisors function

DOI10.4064/cm7792-6-2019zbMath1460.11115arXiv1812.09950OpenAlexW3014878272MaRDI QIDQ5126669

Patrick Letendre, Jean-Marie De Koninck

Publication date: 20 October 2020

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

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

zbMATH Keywords

inequalitiesnumber of divisorsarithmetic functions

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Rate of growth of arithmetic functions (11N56)

Related Items (2)

Every integer can be written as a square plus a squarefree ⋮ Truncated convolution of the M\xF6bius function and multiplicative energy of an integer $n$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the function: Number of prime factors of \(N\).
• Effective bounds for certain functions concerning prime numbers
• Approximate formulas for some functions of prime numbers
• Majorations Explicites Pour le Nombre de Diviseurs de N
• Sur la moyenne des exposants dans la décomposition en facteurs premiers
• Sums of Quotients of Additive Functions

This page was built for publication: New upper bounds for the number of divisors function