benchmarks.wiki / Public workspace

Omni-MATH / On the Cartesian grid, Johnny wants to travel from (0,0) to (5,1), and he wants to pass through all twelve points in the set S=(i,j)∣0≤i≤1,0≤j≤5,i,j∈Z. Each step, Johnny may go f… · Discussion

Discussing On the Cartesian grid, Johnny wants to travel from (0,0) to (5,1), and he wants to pass through all twelve points in the set S={(i,j)∣0≤i≤1,0≤j≤5,i,j∈Z}. Each step, Johnny may go f… · 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.