benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / For every positive integer n, let mod₅(n) be the remainder obtained when n is divided by 5. Define a function f:0,1,2,3,…×0,1,2,3,4→0,1,2,3,4 recursively as follows: … · Discussion

Discussing For every positive integer n, let mod₅(n) be the remainder obtained when n is divided by 5. Define a function f:{0,1,2,3,…}×{0,1,2,3,4}→{0,1,2,3,4} recursively as follows: … · 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.