benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / There are n stones in a heap. Two players play the game by alternatively taking either 1 stone from the heap or a prime number of stones which divides the current number of stones … · Discussion

Discussing There are n stones in a heap. Two players play the game by alternatively taking either 1 stone from the heap or a prime number of stones which divides the current number of stones … · 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.