olymmath

CMO 2020 Problem 3

  • Day 1

Let SS be a set, ∣S∣=35|S|=35 . A set FF of mappings from SS to itself is called to be satisfying property P(k)P(k) , if for any x,y∈Sx,y\in S , there exist f1,⋯ ,fk∈Ff_1, \cdots, f_k \in F (not necessarily different), such that fk(fk−1(⋯(f1(x))))=fk(fk−1(⋯(f1(y))))f_k(f_{k-1}(\cdots (f_1(x))))=f_k(f_{k-1}(\cdots (f_1(y)))) . Find the least positive integer mm , such that if FF satisfies property P(2019)P(2019) , then it also satisfies property P(m)P(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 cn-mo/2020/p3 · Tag 3A3BP31KC2 · Edit this page on GitHub · Keys: j next, k previous