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)= begincasesn^n & k=0 W(W(n, k-1), k-1) & k>0endcases Find the last three digit… · Discussion

Discussing 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… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.