Two combinatorial geometry problems

1) Prove that a (convex or concave) polygon having the perimeter of 2 can be placed inside a circle which has the diameter of 1 pefectly

Hint from teacher:using symmetry of point.

2) With each point X inside convex polygon:A(1)A(2)...A(2009),we set S(X)=XA(1)+XA(2)+...+XA(2009)

Do 2 point P,Q exist inside the polygon that they satisfy:

PQ=1 and |S(P)-S(Q)|=2007

#Geometry #Combinatorics #MathProblem #Math

Note by Hunter Killer
7 years, 8 months ago

No vote yet
3 votes

  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

It is best to separate out your questions into 2 discussion posts, since they are very different questions.

For your second question, you will need to specify extra conditions. For example, if the polygon is too small, then we might not be able to find 2 points such that PQ=1PQ = 1, or allow for S(P)2007 S(P) \geq 2007 . I have a slight suspicion that the vertices of the polygon lie on the unit circle.

Here's another hint for question 1, with an approach that is very different from what you teacher suggests. This is the first approach that I thought of, which is influenced by how I approached similar problems in the past.

Hint: Kelly's Theorem.

Calvin Lin Staff - 7 years, 8 months ago

Log in to reply

Thank Sir.I have just examined Helly Theorem and surprisingly,i prove problem 1 immediately.The most beautiful theorem that I have ever seen :))

Hunter Killer - 7 years, 8 months ago

Log in to reply

Can you write up your solution so that others can learn from it? You have to be careful with some details.

Calvin Lin Staff - 7 years, 8 months ago
×

Problem Loading...

Note Loading...

Set Loading...