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

DOI10.1017/S1446788700013537MaRDI QIDQ4668455zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the function: Number of prime factors of \(N\).
• Smooth divisors of polynomials
• How many primes can divide the values of a polynomial?
• scientific article; zbMATH DE number 169236
• scientific article; zbMATH DE number 3656050

Cites work

• Chebyshev's Inequality and Natural Density
• How often is the number of divisors of n a divisor of n ?
• scientific article; zbMATH DE number 989379 (Why is no real title available?)
• scientific article; zbMATH DE number 3670538 (Why is no real title available?)
• On a Theorem of Hardy and Ramanujan
• On some problems of Mąkowski-Schinzel and Erdős concerning the arithmetical functions and
• On the distribution of integers with a fixed number of prime factors
• On the number of restricted prime factors of an integer. II
• Topics in multiplicative number theory

Cited in

(4)

• Smooth divisors of polynomials
• About the number of -numbers relative to polynomials with integer coefficients
• Arithmetic properties of coefficients of L-functions of elliptic curves
• Some divisibilities amongst the terms of linear recurrences

This page was built for publication: On f(n) modulo Ω(n) and ω(n) when f is a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4668455)