benchmarks.wiki / Public workspace
Omni-MATH / Let S be a set, |S|=35. A set F of mappings from S to itself is called to be satisfying property P(k), if for any x,y∈S, there exist f₁,⋯,f_(k)∈F (not necessarily different), such …
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Let be a set, . A set of mappings from to itself is called to be satisfying property , if for any , there exist (not necessarily different), such that .
Find the least positive integer , such that if satisfies property , then it also satisfies property .
Plain-text mathematical notation (without MathML)
Let S be a set, |S|=35. A set F of mappings from S to itself is called to be satisfying property P(k), if for any x,y∈S, there exist f₁,⋯,f_(k)∈F (not necessarily different), such that f_(k)(f_(k−1)(⋯(f₁(x))))=f_(k)(f_(k−1)(⋯(f₁(y)))). Find the least positive integer m, such that if F satisfies property P(2019), then it also satisfies property P(m).
Original LaTeX notation
Let $S$ be a set, $|S|=35$. A set $F$ of mappings from $S$ to itself is called to be satisfying property $P(k)$, if for any $x,y\in S$, there exist $f_1, \cdots, f_k \in F$ (not necessarily different), such that $f_k(f_{k-1}(\cdots (f_1(x))))=f_k(f_{k-1}(\cdots (f_1(y))))$.
Find the least positive integer $m$, such that if $F$ satisfies property $P(2019)$, then it also satisfies property $P(m)$.Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
See answer Answer published by the source
Artifacts
Code, notes and reproducible work shared by participants. Files are served from a separate origin.
No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import