olymmath

BALTIC-WAY 2024 Problem 9

    Let SS be a finite set. For a positive integer nn, we say that a function f:S→Sf: S \rightarrow S is an nn-th power if there exists some function g:S→Sg: S \rightarrow S such that

    f(x)=g(g(…g(x)…))⏟g applied n times f(x)=\underbrace{g(g(\ldots g(x) \ldots))}_{g \text { applied } n \text { times }}

    for each x∈Sx \in S. Suppose that a function f:S→Sf: S \rightarrow S is an nn-th power for each positive integer nn. Is it necessarily true that f(f(x))=f(x)f(f(x))=f(x) for each x∈Sx \in S ?

    Dataset text NuminaMath olympiads. 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

    Locator baltic-way/2024/p9 · Tag JRS0GX3VXP · Edit this page on GitHub · Keys: j next, k previous