Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Another compex geometry problem

26 views
Skip to first unread message

Sujeet Kumar

unread,
Jan 12, 2011, 8:35:29 AM1/12/11
to app...@support1.mathforum.org
Here is another complex geometry problem-
Q.In a regular planar n-gon , 7 diagonals are concurrent at a point Q.Find least possible value of n.It is given that Q is not the center of the polygon.

**Be wise, generalise.**

gudi

unread,
Jan 22, 2011, 10:56:55 AM1/22/11
to geometry...@moderators.isc.org

By a diagonal is meant a straight line joining non-adjacent vertices?
n=10.

One vertex Q, chosen as point of concurrency, is joined to remaining
7 non-adjacent vertices of a regular decagon ( n = 10) forming 10 -3 =
7 diagonals.

Narasimham

Sujeet Kumar

unread,
Jan 26, 2011, 9:32:34 AM1/26/11
to app...@support1.mathforum.org

I am not getting your solution.Send a diagram.Any n which is multiple of 30 will have this property.So least value
will be 30.
Regards from Sujeet

gudi

unread,
Jan 28, 2011, 8:32:36 AM1/28/11
to geometry...@moderators.isc.org

May be a trivial or extreme solution. If a JavaSketchPad drawn with
all 5 radial lines as diagonals concurring at center of n =10 decagon
and then if center is dragged to any vertex, a diagram of 7 diagonals
would form as in:

http://i51.tinypic.com/2ibnapv.jpg

Regards,
Narasimham

Sujeet Kumar

unread,
Jan 29, 2011, 11:46:25 AM1/29/11
to app...@support1.mathforum.org

Q was supposed to be in the interior of polygon

0 new messages