Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2014 IMO Problems/Problem 6"

(→‎Solution)
(→‎Solution)
Line 3: Line 3:
  
 
==Solution==
 
==Solution==
−
 
−
Hi,
 
−
 
−
I was wondering if the problem seems a bit ambiguous.
 
−
As there are n set of lines in consideration, with the constraint that no two are parallel and none of them are concurrent (constraints 1 and 2).
 
−
Picking any three set of lines from set of n lines (nC3) will give a triangle formed by these lines because of the above constraints. This means if we color any more than 2 set of lines, at least 1 triangle is going to have all the three lines as blue. This sets the upper limit on the number of lines to be colored blue as 2 and not <math>\sqrt{n}</math>. Is this right?
 
−
 
−
Thanks and regards
 
−
----
 
−
Hi,
 
−
 
−
I think this is because (correct me) if a triangle is blue on the perimeter, if there is a line cutting through it, the coloring turns valid.
 
  
 
{{alternate solutions}}
 
{{alternate solutions}}

Revision as of 00:26, 19 February 2020

Problem

A set of lines in the plane is in $\textit{general position}$ if no two are parallel and no three pass through the same point. A set of lines in general position cuts the plane into regions, some of which have finite are; we call these its $\textit{finite regions}$. Prove that for all sufficiently large $n$, in any set of $n$ lines in general position it is possible to colour at least $\sqrt{n}$ of the lines blue in such a way that none of its finite regions has a completely blue boundary.

Solution

Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

Call the $\binom{n}{2}$ intersections, well, points. Then each line will have $n-1$ points. We call 2 points (on a line) neighbors if there are no other points on the line segment joining those 2. Then each finite region has to be a convex polygon whose any pair of neighboring vertices are, well, neighbors. Now start by coloring any line blue, and all points are uncolored (neither red nor blue).

Suppose there is an uncolored line which does not pass through any red points. Color that line blue. Now consider each of the intersections that line makes with the other blue lines. For each intersection point $X$ of the 2 blue lines $l_1,l_2$, color it blue (it was originally uncolored). Now consider the neighbors of $X$ on $l_1,l_2$, call them $A_1,A_2$ on $l_1$ and $B_1,B_2$ on $l_2$ (if there is only 1 neighbor, let the other point be an uncolored dummy). If neither $A_1$ nor $A_2$ is blue, we colour them both red. Else if neither $B_1$ nor $B_2$ is blue, we colour them both red. Otherwise, we colour the uncolored ones (out of the 4 points) red. Anyway, we would have colored at most 2 points red. Once we have done this for all the intersection points, proceed back to the start of this paragraph until no such line exists.

Now to show it works. Suppose there is a finite region polygon $P_1...P_m$ with all blue boundaries (with $P_{m+1}=P_1$). Then all the points must be blue. Consider the first point colored blue, WLOG let it be $P_2$. Suppose the previous line to be colored blue is $P_1P_2$. Then $P_2P_3$ has to be colored blue before that, and $P_3P_4$ has to be uncolored (otherwise $P_3$ will be colored blue first). So $P_3$ is uncolored. Then if $P_1$ is blue, $P_3$ will be colored red by our coloring algorithm. $P_1$ has to be uncolored and by our coloring algorithm at least one of $P_1,P_3$ will be colored red. Note that no blue line will pass through a red point. Thus there are no finite region with blue boundaries.

Now suppose $k$ lines are blue. By our algorithm, each blue point intersection will introduce at most 2 red points. Since we can't color any more lines blue, those red points will cover the remaining lines. Thus $2\binom{k}{2}\geq n-k\implies k\geq \sqrt{n}$ exact.

Note: this works for all $n$, provided there is no mistake.

See Also

2014 IMO (Problems) • Resources
Preceded by
Problem 5 		1 • 2 • 3 • 4 • 5 • 6 Followed by
Problem 6
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2014_IMO_Problems/Problem_6&oldid=117930"