olymmath

IZhO 2019 Problem 5

    Let n>1n>1 be a positive integer. A function f:I→Zf: I \rightarrow \mathbb{Z} is given, where II is the set of all integers coprime with nn. ( Z\mathbb{Z} is the set of integers). A positive integer kk is called a period of the function ff if f(a)=f(b)f(a)=f(b) for all a,b∈Ia, b \in I such that a≡b( mod k)a \equiv b(\bmod k). It is known that nn is a period of ff. Prove that the minimal period of the function ff divides all its periods.

    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

    Similar problems

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

    Locator zhautykov/2019/p5 · Tag GVF56VXF56 · Edit this page on GitHub · Keys: j next, k previous