benchmarks.wiki / Public workspace

Omni-MATH / Let S={1,2,…2016}, and let f be a randomly chosen bijection from S to itself. Let n be the smallest positive integer such that f^((n))(1)=1, where f^((i))(x)=f(f^((i−1))(x)). What …

Problem

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

problem

Let S={1,2,…2016}S=\{1,2, \ldots 2016\}, and let ff be a randomly chosen bijection from SS to itself. Let nn be the smallest positive integer such that f(n)(1)=1f^{(n)}(1)=1, where f(i)(x)=f(f(i−1)(x))f^{(i)}(x)=f\left(f^{(i-1)}(x)\right). What is the expected value of nn?
Plain-text mathematical notation (without MathML)
Let S={1,2,…2016}, and let f be a randomly chosen bijection from S to itself. Let n be the smallest positive integer such that f^((n))(1)=1, where f^((i))(x)=f(f^((i−1))(x)). What is the expected value of n?
Original LaTeX notation
Let $S=\{1,2, \ldots 2016\}$, and let $f$ be a randomly chosen bijection from $S$ to itself. Let $n$ be the smallest positive integer such that $f^{(n)}(1)=1$, where $f^{(i)}(x)=f\left(f^{(i-1)}(x)\right)$. What is the expected value of $n$?

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