This is inspired by Mehul Chaturvedi's question Equally divided 10 points.
Consider all sets of 10 points in the plane, in which no 3 are collinear. A line that connects 2 of these points is a dividing line if it divides the remaining points into 2 equal regions of 4 points each. Over all configurations, what is the maximum number of dividing lines?
By a simple counting argument, we can show that there are at least 5 dividing lines in any configuration.
If the 10 points form a convex set (ie no points are in the interior of the convex hull), then we can prove that there are exactly 5 dividing lines.
To get more than 5, consider the vertices of a 9-gon, along with the center. Then, any vertex that is connected to the center gives us a dividing line, and so there are (at least) 9 such lines.
Can we do better?
Can we generalize this to ?
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.