benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For each positive integer n and non-negative integer k, define W(n,k) recursively by W(n, k)= begin{cases}n^{n} & k=0 W(W(n, k-1), k-1) & k>0end{cases} Find the last three digit…

Problem

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

problem

For each positive integer nn and non-negative integer kk, define W(n,k)W(n, k) recursively by $$ W(n, k)= \begin{cases}n^{n} & k=0 \\ W(W(n, k-1), k-1) & k>0\end{cases} $$ Find the last three digits in the decimal representation of W(555,2)W(555,2).
Plain-text mathematical notation (without MathML)
For each positive integer n and non-negative integer k, define W(n,k) recursively by $$ W(n, k)= \begin{cases}n^{n} & k=0 \\ W(W(n, k-1), k-1) & k>0\end{cases} $$ Find the last three digits in the decimal representation of W(555,2).
Original LaTeX notation
For each positive integer $n$ and non-negative integer $k$, define $W(n, k)$ recursively by $$ W(n, k)= \begin{cases}n^{n} & k=0 \\ W(W(n, k-1), k-1) & k>0\end{cases} $$ Find the last three digits in the decimal representation of $W(555,2)$.

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

task_id
8f9ff9ca-abf2-56c3-a82f-7d91710affa6
task_key
test--8f9ff9ca-abf2-56c3-a82f-7d91710affa6
task_revision_id
1
config / split
/ test

Official source

initial import