Let \[f, g: \mathbb{N}-\{1\} \rightarrow \mathbb{N}\] be functions defined by \[f(a)=\alpha\], where \[\alpha\] is the maximum of the powers of those primes p such that \[p^{\alpha}\] divides a, and g(a)=a+1, for all \[a \in \mathbb{N}-\{1\}\]. Then, the function f+g is
Solutions · 1
Official solution
\[f,g:N - \{ 1\} \to N\] defined as
\[f(a) = \alpha \], where \[\alpha\] is the maximum power of those primes p such that p\[\alpha\] divides a.
g(a)=a+1,
Now,
\[f(2)=1,f(3)=1,f(4)=2,f(5)=1,g(2)=3g(3)=4g(4)=5g(5)=6⇒⇒⇒⇒(f+g)(2)=4(f+g)(3)=5(f+g)(4)=7(f+g)(5)=7 \]
\[\because\] \[(f + g)\,(5) = (f + g)\,(4)\]
\[\therefore\] f+g is not one-one
Now, \[\because\] \[{f_{\min }} = 1,\,{g_{\min }} = 3\]
So, there does not exist any \[x \in N - \{ 1\} \] such that (f+g)(x)=1,2,3
\[\therefore\] f+g is not onto