MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Carlitz showed necessary and sufficient conditions for an arithmetic function to be a linear combination of two multiplicative functions. He mentions the possibility of generalizing to $k$ multiplicative functions, but as far as I can tell this was never published.

What is known about arithmetic functions which can be represented as linear combinations of some fixed number $k$ of multiplicative functions? Given $k$, how many terms 1, 2, ..., n are needed to either reject it as a linear combination of $k$ multiplicative functions or to generate (partial) multiplicative functions and their coefficients?

[1] L. Carlitz, Sums of arithmetic functions, Collectanea Mathematica 20:2 (1969), pp. 108-126.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.