benchmarks.wiki / Public workspace

Omni-MATH / We randomly choose a function f:[n]→[n], out of the n^(n) possible functions. We also choose an integer a uniformly at random from [n]. Find the probability that there exist positi…

Problem

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

problem

We randomly choose a function f:[n]→[n]f:[n] \rightarrow[n], out of the nnn^{n} possible functions. We also choose an integer aa uniformly at random from [n][n]. Find the probability that there exist positive integers b,c≥1b, c \geq 1 such that fb(1)=af^{b}(1)=a and fc(a)=1f^{c}(a)=1. (fk(x)\left(f^{k}(x)\right. denotes the result of applying ff to xkx k times).
Plain-text mathematical notation (without MathML)
We randomly choose a function f:[n]→[n], out of the n^(n) possible functions. We also choose an integer a uniformly at random from [n]. Find the probability that there exist positive integers b,c≥1 such that f^(b)(1)=a and f^(c)(a)=1. (f^(k)(x) denotes the result of applying f to xk times).
Original LaTeX notation
We randomly choose a function $f:[n] \rightarrow[n]$, out of the $n^{n}$ possible functions. We also choose an integer $a$ uniformly at random from $[n]$. Find the probability that there exist positive integers $b, c \geq 1$ such that $f^{b}(1)=a$ and $f^{c}(a)=1$. $\left(f^{k}(x)\right.$ denotes the result of applying $f$ to $x k$ times).

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