olymmath

RO-TST 1991 Problem 8

    Let n,a,bn, a, b be integers with n≥2n \geq 2 and a∉{0,1}a \notin \{0, 1\} and let u(x)=ax+bu(x) = ax + b be the function defined on integers. Show that there are infinitely many functions f:Z→Zf : \mathbb{Z} \rightarrow \mathbb{Z} such that fn(x)=f(f(⋯f⏟n(x)⋯ ))=u(x)f_n(x) = \underbrace{f(f(\cdots f}_{n}(x) \cdots )) = u(x) for all xx . If a=1a = 1 , show that there is a bb for which there is no ff with fn(x)≡u(x)f_n(x) \equiv u(x) .

    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 ro-tst/1991/p8 · Tag WBPAE45SSF · Edit this page on GitHub · Keys: j next, k previous