olymmath

ILL 1983 Problem 20

    Let ff and gg be functions from the set AA to the same set AA . We define ff to be a functional nn -th root of gg ( nn is a positive integer) if fn(x)=g(x)f^n(x) = g(x) , where fn(x)=fn−1(f(x)).f^n(x) = f^{n-1}(f(x)). (a) Prove that the function g:R→R,g(x)=1/xg : \mathbb R \to \mathbb R, g(x) = 1/x has an infinite number of nn -th functional roots for each positive integer n.n. (b) Prove that there is a bijection from R\mathbb R onto R\mathbb R that has no nth functional root for each positive integer n.n.

    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 ill/1983/p20 · Tag J7AZ1HDPX3 · Edit this page on GitHub · Keys: j next, k previous