The diagram above shows another triangle. There are \(n\) points on every side of this triangle, between every 2 points (both points are on different sides) there is a line connecting them, these lines will split the triangle into portions and no three lines intersect at 1 point. The above diagram shows an example of \(n=2\) which will split the triangle into 28 portions, if \(n=10\), what is the total number of portions?

Also try Nasty Triangles 3.

×

Problem Loading...

Note Loading...

Set Loading...