The Dirichlet convolutions was introduced here. The following illustrates a proof technique that avoids writing nd over and over again.
Theorem
Proof:-
For any n we have
(f*g)(n)
=
= [ as runs through all divisors of , so does ]
=
=
(proven)
The proof technique can be extended to prove the associativity law.
No comments:
Post a Comment
Comment répondez vous?