Completely multiplicative functions arising from simple operations

The authors propose the following general type of problem concerning multiplicative functions. Given two multiplicative functions, determine simple necessary and sufficient conditions for their Dirichlet convolution, powers, and logarithms to be completely multiplicative. Powers and logarithms are those introduced by \textit{D. Rearick} [Duke Math. J. 35, 761--766 (1968; Zbl 0169.37201), and later by \textit{L. Carlitz} and \textit{M. V. Subbarao} [Duke Math. J. 40, 949--958 (1973; Zbl 0277.10007)]. As expected, the conditions are expressed in terms of values at the prime powers \(p^a\). Here is a sample result: If \(f\) is completely multiplicative and if \(g\) is multiplicative, then the Dirichlet convolution \(f*g\) is completely multiplicative if and only if \(g(p^a)=g(p)(g(p)+f(p))^{a-1}\). Applications are given to related problems.

Recommendations

Cited in

(8)

This page was built for publication: Completely multiplicative functions arising from simple operations

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