Let be 15 points on a circle. The number of distinct triangles formed by points such that , is:
We have 15 distinct points lying on a circle. Because no three points on a circle are collinear, every choice of three different points gives a triangle.
The total number of ways to choose any three points from 15 is obtained from the combination formula Substituting and gives
$
So, without any restriction, triangles can be drawn.
Now we must remove those triangles whose indices satisfy the extra condition (because such triples are not allowed; the question says ).
To avoid double-counting we consider unordered triples with . We list all sets of three distinct positive integers between 1 and 15 whose sum is exactly 15.
Start with the smallest possible first index.
When we need with .
Possible pairs are
That gives 5 triples: $
When we need with Pairs are giving 4 triples: $
When we need with Pairs are giving 2 triples:
When we need with The only possible pair is giving 1 triple:
When the smallest possible sum is so no further solutions occur.
Thus the total number of disallowed triples is
Finally, subtract these 12 forbidden triangles from the 455 total triangles:
Hence, the correct answer is Option D.
Tagged Counting in geometry. Machine-assigned, so read it as a strong shortlist rather than a verdict.