Multiplicative Function Questions

1) Show that if *p* is prime, is composite for *a* = 1,2,....,r and *p* is not a Fermat prime, where *r* is a positive integer, then has no solution.

2) The arithmetic funtion *g* is said to be the *inverse* of the arithmetic function *f* if *f * g = g * f = i*. Show that the arithmetic function *f *has an *inverse* if and only if f(1) does not equal 0. Show that if *f* has an inverse it is unique.

(Hint: When f(1) is not equal to 0, find the inverse of *f* by calculating recursively, using the fact that i(n) = summation .)