Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Re: Another compex geometry problem
Posted:
Jan 29, 2011 8:25 AM


> On Jan 26, 7:32 pm, Sujeet Kumar > <sujeetkumar...@gmail.com> wrote: > > > On Jan 12, 6:35 pm, Sujeet Kumar > > > <sujeetkumar...@gmail.com> wrote: > > > > Here is another complex geometry problem > > > > Q.In a regular planar ngon , 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.** > > > > > By a diagonal is meant a straight line joining > > > nonadjacent vertices? > > > n=10. > > > > > One vertex Q, chosen as point of concurrency, is > > > joined to remaining > > > 7 nonadjacent vertices of a regular decagon ( n > = > > > 10) forming 10 3 = > > > 7 diagonals. > > > > > Narasimham > > > > 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 > > 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
Q was supposed to be in the interior of polygon



