Waste less time on Facebook — follow Brilliant.
×

Proof Contest Day 2

For any regular \(n\) sided polygon, if we choose any point inside the polygon (not on side) and drop one perpendicular to every side from the point prove that the sum of all the heights remain constant, irrespective where the points lies inside the polygon.

Note by Lakshya Sinha
1 year, 10 months ago

No vote yet
1 vote

  Easy Math Editor

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 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Let the side of each polygon be \(b\). And join the vertices with the point.

Now area of each triangle (formed by two adjacent vertices of the polygon and that point), will be \[\frac12bh_i\] where \(h_i\) is one of those heights.

Now, the sum of all the triangles would equal the area of the polygon, let the total area of polygon be \(A\).

So we get \[\frac12b(h_1+h_2+...+h_n)=A\] And thus,

\[\sum h_i=\frac{2A}{b}\]

This shows it will always be constant until the point is in the polygon.

Aditya Agarwal - 1 year, 10 months ago

Log in to reply

Oops !! I didn't saw your solution and you beated me while writing the solution.

Akshat Sharda - 1 year, 10 months ago

Log in to reply

No problem brother. (y)

Aditya Agarwal - 1 year, 10 months ago

Log in to reply

I have edited out your solution. Nice (+1)

Lakshya Sinha - 1 year, 10 months ago

Log in to reply

You would have fun solving Follow Up Problem. :)

Nihar Mahajan - 1 year, 10 months ago

Log in to reply

Comment deleted Jan 07, 2016

Log in to reply

Comment deleted Jan 07, 2016

Log in to reply

Comment deleted Jan 07, 2016

Log in to reply

Comment deleted Jan 07, 2016

Log in to reply

@Lakshya Sinha Should I delete mine or let it be ?

Akshat Sharda - 1 year, 10 months ago

Log in to reply

@Akshat Sharda I believe you should delete but if you have another different solution then upload that.

Lakshya Sinha - 1 year, 10 months ago

Log in to reply

I didn't saw that....maybe he wrote at the same time as me but a bit faster.

Akshat Sharda - 1 year, 10 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...