Pls help

!
this is a common Q, however i am stuck at the approach. Why 1 method works and the other doesnt.
Q > Find the number of triangles whose vertices are vertices of an octagon but none of the sides of such triangle are taken from the sides of the octagon.
as there is a limit on the number of characters I am sending u the link to the thread > u can find my approach @
http://www.pagalguy.com/forum/quanti...ml#post1622786.
Please let me know.Thank you. Will really appreciate any feedback you can give
