benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest positive integer n such that if n squares of a 1000×1000 chessboard are colored, then there will exist three colored squares whose centers form a right triangle w… · Discussion

Discussing Find the smallest positive integer n such that if n squares of a 1000×1000 chessboard are colored, then there will exist three colored squares whose centers form a right triangle w… · 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.