On f(n) modulo Ω(n) and ω(n) when f is a polynomial

DOI10.1017/S1446788700013537zbMath1165.11335OpenAlexW2017759301MaRDI QIDQ4668455

Florian Luca

Publication date: 19 April 2005

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446788700013537

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37)

Related Items

Arithmetic properties of coefficients of \(L\)-functions of elliptic curves ⋮ Some divisibilities amongst the terms of linear recurrences ⋮ About the number of τ-numbers relative to polynomials with integer coefficients

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of restricted prime factors of an integer. II
• How often is the number of divisors of n a divisor of n ?
• On the distribution of integers with a fixed number of prime factors
• Topics in multiplicative number theory
• On some problems of Mąkowski–Schinzel and Erdős concerning the arithmetical functions φ and σ
• Chebyshev's Inequality and Natural Density
• On a Theorem of Hardy and Ramanujan