tag:blogger.com,1999:blog-2187609620993289734.post1157943640333737826..comments2013-05-09T02:41:42.191+05:30Comments on Reflections and Novelties: Challenge problem - From a classic Steven Krantz book -Hrishikeshhttp://www.blogger.com/profile/06025337426703041620noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-2187609620993289734.post-78803075736746143272009-05-30T02:21:00.580+05:302009-05-30T02:21:00.580+05:30i don't know if i understood the problem statement...i don't know if i understood the problem statement clearly. anyway, i'll let u know my thoughts...<br /><br />i guess even if u have 5 points and 2 colors, then there will be atleast 1 triangle that has all the 3 lines of same color. correct me if i'm wrong.<br /><br />the number of lines that will be drawn from each point will N-1, where N is the number of points. and the total number lines in the figure will always be (N*(N-1))/2.<br /><br />now these equations coupled with 3 (sides of triangle) should give u the generalization that u r looking for... hopefully :DVivek Athalyehttps://www.blogger.com/profile/08113944409639107675noreply@blogger.com