benchmarks.wiki / Public workspace

Omni-MATH / Let X be the collection of all functions f:{0,1,…,2016}→{0,1,…,2016}. Compute the number of functions f∈X such that …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let XX be the collection of all functions f:{0,1,…,2016}→{0,1,…,2016}f:\{0,1, \ldots, 2016\} \rightarrow\{0,1, \ldots, 2016\}. Compute the number of functions f∈Xf \in X such that maxg∈X(min0≤i≤2016(max(f(i),g(i)))−max0≤i≤2016(min(f(i),g(i))))=2015\max _{g \in X}\left(\min _{0 \leq i \leq 2016}(\max (f(i), g(i)))-\max _{0 \leq i \leq 2016}(\min (f(i), g(i)))\right)=2015
Plain-text mathematical notation (without MathML)
Let X be the collection of all functions f:{0,1,…,2016}→{0,1,…,2016}. Compute the number of functions f∈X such that max_(g∈X)(min_(0≤i≤2016)(max(f(i),g(i)))−max_(0≤i≤2016)(min(f(i),g(i))))=2015
Original LaTeX notation
Let $X$ be the collection of all functions $f:\{0,1, \ldots, 2016\} \rightarrow\{0,1, \ldots, 2016\}$. Compute the number of functions $f \in X$ such that $$\max _{g \in X}\left(\min _{0 \leq i \leq 2016}(\max (f(i), g(i)))-\max _{0 \leq i \leq 2016}(\min (f(i), g(i)))\right)=2015$$

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. 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. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import