• If f and g are completely multiplicative arithmetic functions, then f *g must also be completely multiplicative. Proof: : дcd(m, п) .. Any divisor of mn is the form d = d,d2 where d1 | m and d, | n * m, n has no shared divisor .. f * g(mn) = Ea edmn (d)g() = Edilm Edzln F(d1d2)g() Σ Σm f(di)f(da)g(Η )g(H) . Σmf (d1)g(H) Σ.u f (d%) g ( H) :: (f * g)(m)(f * g)(n) • If f and g are arithmetic functions and f * g is completely multiplicative, then dı|m 2|n both f and g must be completely multiplicative. • Convolution of arithmetic functions is associative: (f * g) * h = f * (g * h) for arithmetic functions f, g and h.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Please do the second and third one thanks!

1. Prove or provide a counterexample to each of the following statements:
• If f and g are completely multiplicative arithmetic functions, then f *g must also
be completely multiplicative.
Proof:
* gcd(m, n)
. Any divisor of mn is the form d = d,d, where d | m and d, | n
* m, n has no shared divisor
.. f * g(mn) = Eamn f (d)g() = di|m Edz]n f(d1d2)g()
= 1
тп
: Σm Σn f(di)f(d)g(Ή)g(X)
. Σf(d1)g(H) Σιμ f(d)g( )
dı|m
d2|n
:: (f * g)(m)(f * g)(n)
• If f and g are arithmetic functions and f * g is completely multiplicative, then
both f and g must be completely multiplicative.
• Convolution of arithmetic functions is associative: (f * g) * h = f * (g * h) for
arithmetic functions f, g and h.
Transcribed Image Text:1. Prove or provide a counterexample to each of the following statements: • If f and g are completely multiplicative arithmetic functions, then f *g must also be completely multiplicative. Proof: * gcd(m, n) . Any divisor of mn is the form d = d,d, where d | m and d, | n * m, n has no shared divisor .. f * g(mn) = Eamn f (d)g() = di|m Edz]n f(d1d2)g() = 1 тп : Σm Σn f(di)f(d)g(Ή)g(X) . Σf(d1)g(H) Σιμ f(d)g( ) dı|m d2|n :: (f * g)(m)(f * g)(n) • If f and g are arithmetic functions and f * g is completely multiplicative, then both f and g must be completely multiplicative. • Convolution of arithmetic functions is associative: (f * g) * h = f * (g * h) for arithmetic functions f, g and h.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Research Ethics
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,