An Odd Cycle Argument
Problem
The set is partitioned arbitrarily into two disjoint nonempty subsets. Prove that at least one of the subsets contains two numbers whose sum is a perfect square.
Answer
Solution
| Difficulty | 7/10 |
|---|---|
| Topics | combinatorics, Graph Theory, number theory, Pigeonhole |
Whiteboard
Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.
Discussion
Ask questions, share alternate solutions, and use LaTeX freely.
Log in to join the discussion.
No comments yet.