k-additive uniqueness of the set of squares for multiplicative functions

Abstract

P. V. Chung showed that there are many multiplicative functions f which satisfy f(m2+n2) = f(m2)+f(n2) for all positive integers m and n. In this article, we show that if more than 2 squares in the additive condition are involved, then such f is uniquely determined. That is, if a multiplicative function f satisfies \[ f(a12 + a22 + …b + ak2) = f(a12) + f(a22) + …b + f(ak2) \] for arbitrary positive integers ai, then f is the identity function. In this sense, we call the set of all posotive squares a k-additive uniqueness set for multiplicative functions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…