Fonctions arithmétiques tronquées. (Truncated arithmetic functions)
The authors derive a number of identities for arithmetic functions of the form \(g_ m(n)=\sum_{d| n;\omega (d)\leq m}g(n/d)\), where g is a given arithmetic function and \(\omega\) (d) denotes the number of distinct prime divisors of d. For example, Theorem 2 states that \(\mu_ m(n)=(- 1)^ m\left( \begin{matrix} \omega (n)-1\\ -m\end{matrix} \right)\mu (n),\) where \(\mu\) (n) is the Möbius function; Theorem 5 gives a Möbius type inversion formula for functions of the form \(f_ m(n)\); and Theorem 6 gives a formula for the function \(\sum_{d| n}\mu_ m(d)p_ r(d)\), where \(p_ r(d)\) is the rth smallest prime factor of n.
- Duality between prime factors and an application to the prime number theorem for arithmetic progressions
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3414311 (Why is no real title available?)
This page was built for publication: Fonctions arithmétiques tronquées. (Truncated arithmetic functions)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804617)
