IMO 2014/6

A set of lines in the plane is in 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 finte area; we call these its finite regions. Prove that for all sufficiently large nn, in any set of nn lines in general position it is possible to colour at least n \sqrt{n} of the lines blue in such a way that none of its finite regions has a completely blue boundary.

Note: Results with n \sqrt{n} replaced by cn c \sqrt{n} will be awarded points depending on the value of the constant cc.

Note by Calvin Lin
5 years, 3 months ago

No vote yet
1 vote

  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:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

Does anyone have a solution for this one? Based on what I've heard from the Indian IMOers, only one of them attempted it (and got 2). I'll work on this in school.

Sreejato Bhattacharya - 5 years, 3 months ago

Log in to reply

Only 15 people got full marks for this. I'm not too sure how to proceed with this, and I'm guessing that a probabilistic expectation method is used.

Calvin Lin Staff - 5 years, 3 months ago

Log in to reply

I've heard that there exists a purely elementary solution: one can simply construct an algorithm which satisfies the problem conditions. However since this is an IMO P6 and I extremely suck at combinatorics, I haven't made much significant progress yet.

And well, a probabilistic approach given by Evan Chen (TWN 2; v_Enhance on AoPS) gives a bound of 16e3n\dfrac{1}{\sqrt[3]{6e}}\sqrt{n} which is unfortunately smaller than n.\sqrt{n}. There should exist a solution using the probabilistic method, though. Also, I have heard that the bound can actually be improved to nln(n).\sqrt{n \ln (n)}.

Sreejato Bhattacharya - 5 years, 3 months ago

Log in to reply

There exists an elementary solution using the extremal principle. Surprisingly, the probabilistic method isn't needed for c = 1.

Zi Song Yeoh - 5 years, 3 months ago

Log in to reply

Note: Results with n\sqrt{n} replaced by cnc\sqrt{n} will be awarded points depending on the value of the constant nn.

That single sentence got me scared at the IMO. I didn't even read the problem after that. :)

Shenal Kotuwewatta - 4 years, 12 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...