Imgur
Place any number of colored boxes on the infinite plane. You have to connect similarly colored boxes, so boxes of each color form a single cycle (each colored box is connected to two similarly colored boxes).
Given that boxes do not touch each other, prove that it is always possible to connect the boxes in this manner such that there are no intersections between the connecting lines.
Inspired by Connecting Colored Boxes. However, that problem is different in nature because it is contained in a finite plane and some boxes are on the edge of that plane.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Connect the boxes of the same color in a cycle (in any order). Do it for all colors. Then all nodes have degree 2. Hence by Kuratowski's theorem the resulting graph is planar.
Log in to reply
Hey! I want to know something about you....How did you get to MIT ?means by giving SAT or something else...
Hey Hello!
Hey Daniel Liu! your post looksgood as always but oftenly your image does'nt read correctly on my phone, the picture did'nt show up. So try to change the web you are saving those picture, i think it's.. not only happen to me.
Log in to reply
Chances are, if the image isn't reading, then it's a problem on your phone or on brilliant's phone app. Sorry for the inconvenience :\