A problem inspired by the game, Infinity Loop, for iPhone and Android.
Consider a subset of an infinite lattice grid, consisting of all points where are integers ranging from to inclusive.
Let each lattice point be assigned an integer ranging from to inclusive. Define a connection of as an operation in which you add line segments between two horizontally or vertically adjacent lattice points, such that the point is connected to exactly segments for all points in the set. Each pair of adjacent points may have at most one line segment connecting them. Points in the corners can have at most 2 line segments, points on the sides 3, and points in the middle 4.
Given that you know all the , is it always possible to tell whether a connection of exists?
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
There are no comments in this discussion.