olymmath

HMMT 2016 U8

  • Guts
  • Answer

For each positive integer nn and non-negative integer kk, define W(n,k)W(n, k) recursively by

W(n,k)={nnk=0W(W(n,k−1),k−1)k>0W(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).

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

875

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2016/u8 · Tag 4MJCHY4S1F · Edit this page on GitHub · Keys: j next, k previous