benchmarks.wiki / Public workspace

Omni-MATH / Let n>1 be an odd integer. On an n×n chessboard the center square and four corners are deleted. We wish to group the remaining n²−5 squares into (1)/(2)(n²−5) pairs, such that the … · Discussion

Discussing Let n>1 be an odd integer. On an n×n chessboard the center square and four corners are deleted. We wish to group the remaining n²−5 squares into (1)/(2)(n²−5) pairs, such that the … · 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.