olymmath

BG-MO 1995 Problem 5

    Let A={1,2,...,m+n}A = \{1,2,...,m + n\} , where m,nm,n are positive integers, and let the function f : A→AA \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:A→Ag : A \to A such that g(g(a))=f(a)g(g(a)) = f(a) for all a∈Aa \in A . (b) Prove that if mm is even, then there is a function g:A→Ag : A\to A such that g(g(a))=f(a)g(g(a))=f(a) for all a∈Aa \in A is and only if n=mn = m .

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator bg-mo/1995/p5 · Tag 9SPFVEY946 · Edit this page on GitHub · Keys: j next, k previous