Abstract

(4) f (n1n2) f(n1) + f (n2) whenever (n,, n2 ) =1; (f (1) 0). In fact, the series (1) is convergent for every choice of the double sequence { {al} }, since the series has, for every fixed n, at most a finite number of non-vanishing terms. It is also clear that an additive function f and either of the two sequences of additive functions {ff}, {fk} of n determine each other uniquely. The additive functions tQ be considered will be assumed to be real-valued. For a given y f(n), define y+ f+(n) by placing (5) y+ y or y 1 according, as !y I < 1 or I y ?1.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.