MathDB
exists g(g(a)) = f(a) if f(m) = 1, f(m+n) = m+1 and f(i) = i+1 for all other i

Source: 1995 Bulgaria NMO, Round 4, p5

July 30, 2021
functionfunctionalalgebra

Problem Statement

Let A={1,2,...,m+n}A = \{1,2,...,m + n\}, where m,nm,n are positive integers, and let the function f : AAA \to A be defined by: f(m)=1f(m) = 1, f(m+n)=m+1f(m+n) = m+1 and f(i)=i+1f(i) = i+1 for all the other ii. (a) Prove that if mm and nn are odd, then there exists a function g:AAg : A \to A such that g(g(a))=f(a)g(g(a)) = f(a) for all aAa \in A. (b) Prove that if mm is even, then there is a function g:AAg : A\to A such that g(g(a))=f(a)g(g(a))=f(a) for all aAa \in A is and only if n=mn = m.