Please throw some light on counting k-sided polygon in an n-sided polygon under different conditions viz how many triangles can be drawn using vertices of a 15 sided polygon if none of the sides of the polygon is also side of the triangle and in similar way how to find out number of hexagons,equilateral triangles,isosceles triangles etc.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
The answer is kn(k−1n−k−1).Hint:Stars and bars logic is involved.