# Thread:

1. ## Multiplicative Function Questions

1) Show that if p is prime, $2^ap+1$ is composite for a = 1,2,....,r and p is not a Fermat prime, where r is a positive integer, then $\phi(n) = 2^rp$ 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 $f^{-1}$ of f by calculating $f^{-1}(n)$ recursively, using the fact that i(n) = summation $(f(d)f^{-1}(n/d)$.)

2. 1) seems like it shouldn't be too difficult. I don't get what I'm trying to prove though. How would the value of $2^rp$ be able to show that it is not solvable? I know $\phi(n)$ is always even when $n \geq 2$. But $2^rp$ is always going to be even, so I'm confused as to how I prove this.

2) I don't even understand how I recursively go back and do this.

f*f{-1} = i, and set i = summation....
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 9, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9534348845481873, "perplexity_flag": "head"}