induction (1 Viewer)

[Esse]

Prove by induction the number of triangles that can be formed by connecting 3 points is n(n-1)(n-2)/6

 

[InteGrand]

Prove by induction the number of triangles that can be formed by connecting 3 points is n(n-1)(n-2)/6

This isn't an inductive way but the result follows immediately from the fact that the given expression is n choose 3 and this is the no. of ways to choose 3 points from the n-gon.