Take it 1 part at a time. There is a formula for all the 1-size triangles facing in one direction, and a formula for all the 1-size triangles facing in the other direction. Then the 2-size triangles, then the 3-size triangle.
Then add them all up :) On Mon, Oct 19, 2009 at 4:34 AM, 2shar007 <[email protected]> wrote: > > In the puzzle, /_\ > /_\/_\ > /_\/_\/_\ this is having 10 > vertices, we are to find the no.of triangles which is 13 here > > I tried to derive a general formula, but couldn't :( > What I understood was triangles have vertices as n(n+1)/2, > n=2,3,4,5.................. > > Also that the no. of triangles for k(k+1)/2 vertices is no.of > triangles in k(k-1)/2 + triangles of all sizes with atleast one > vertex in the larger triangle. > > will be grateful if someone could give a fitting reply > Thanks in advance > > > > -- Paul Smith http://www.nomadicfun.co.uk [email protected] --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
