Content deleted Content added
tat was false for 54,032,858,972,279 and i gave the detail of the computing |
|||
Line 81:
From any additive function <math>f(n)</math> it is possible to create a related {{em|[[multiplicative function]]}} <math>g(n),</math> which is a function with the property that whenever <math>a</math> and <math>b</math> are coprime then:
<math display=block>g(a b) = g(a) \times g(b).</math>
One such example is <math>g(n) = 2^{f(n)}.</math> Likewise if <math>f(n)</math> is completely additive, then <math>g(n) = 2^{f(n)} </math> is completely multiplicative. More generally, we could consider the function <math>g(n) = c^{f(n)} </math>, where <math>c</math> is a nonzero real constant.
== Summatory functions ==
| |||