Doodling with points

66 points are taken on a plane such that the distance between any two of them is at most 22 units.Show that there are at least two points whose distance is less than 2\sqrt{2}.

After you have solved this problem you can use a similar concept for this problem

Post your solution in the comments :)

#Combinatorics #CombinatorialGeometry #CosinesGroup #Goldbach'sConjurersGroup #TorqueGroup

Note by Eddie The Head
7 years, 2 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

I have yet to see an ordering of 55 points that satisfies the above conditions...

As for the proof, I've been trying to make a pigeonhole principle-based proof, but it just isn't working... :|

Daniel Liu - 7 years, 2 months ago

Log in to reply

You're going in the right direction.....

Eddie The Head - 7 years, 2 months ago

Perhaps the given statement isn't the tightest possible one? Which then begs the question, how much tighter can you make it?

You can either reduce the number of points, or reduce the minimum distance.

Calvin Lin Staff - 7 years, 2 months ago

Log in to reply

Sir, it would be immensely helpful if you go through the solution that I wrote to one of your problems Click here for the link

Eddie The Head - 7 years, 2 months ago

I tried plotting the points in a pentagon, with an extra point in one of the 5 triangles. Then, the side of the pentagon would be 2. Then there are two possibilities. Either all the other 4 points are the farther vertices of the pentagon, or they are on the midpoint of each of the sides. That is as far as I have gotten to.

Nanayaranaraknas Vahdam - 7 years, 2 months ago
×

Problem Loading...

Note Loading...

Set Loading...