Let A={1,2,...,m+n}, where m,n are positive integers, and let the function f : A→A be defined by:
f(m)=1, f(m+n)=m+1 and f(i)=i+1 for all the other i.
(a) Prove that if m and n are odd, then there exists a function g:A→A such that g(g(a))=f(a) for all a∈A.
(b) Prove that if m is even, then there is a function g:A→A such that g(g(a))=f(a) for all a∈A is and only if n=m. functionfunctionalalgebra