2010 AMC 10A Problem 22
Eight points are chosen on a circle, and chords are drawn connecting every pair of points. No three chords intersect in a single point inside the circle. How many triangles with all three vertices in the interior of the circle are created?
Show solution without answering
Key insight
Each inside triangle comes from three chords that all cross, using six different points; each group of 6 points gives exactly one triangle.
Solution
Instead of counting triangles directly, find what each triangle is made of.
1. Three chords per triangle. Each side of a triangle inside the circle lies along one of the chords. Its corners are points where two of those chords cross. So a triangle needs three chords, and every two of them must cross inside the circle.
2. When do two chords cross? Two chords cross inside the circle only if they have no shared endpoint and their endpoints take turns around the circle (A, then B, then A, then B). So three chords that all cross each other use different points.
3. Going the other way. Pick any of the points and number them to going around the circle. Is there a way to join them into three chords that all cross each other?
- Join each point to the one directly across: –, –, –. Each pair of these crosses, so they form a triangle. (No three chords meet at one point, so the three crossings really are three different corners.)
- Any other pairing uses a chord that skips over at most one point, like – or –. A chord – has no points on one side, so nothing crosses it. A chord – has only point on one side, so only the chord from can cross it, not both of the others. So joining across is the only way.
4. So each group of 6 points gives exactly one triangle, and each triangle comes from exactly one group of 6 points. Count the groups of points out of . Choosing to keep is the same as choosing to leave out:
The answer is .
Why this works
A hard-to-count shape (a small triangle inside the circle) matches up perfectly with an easy-to-count thing (a group of six points on the circle). When you can pair up each object with exactly one simple choice, counting the choices counts the objects. The same idea shows there is one inside crossing point for every group of points.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
A triangle with all three vertices inside the circle has its three sides lying on three chords, and each pair of those chords must cross inside the circle (the crossing points are the triangle's vertices).
Two chords cross inside the circle exactly when their four endpoints alternate around the circle, so they share no endpoint. Three chords that pairwise cross therefore use distinct points on the circle.
Conversely, pick any of the points. Label them in circular order . The only way to pair them into three mutually crossing chords is the three "long diagonals" , , (any other pairing includes a chord like or that some other chord in the pairing fails to cross). Those three diagonals pairwise cross at three distinct points, forming exactly one interior triangle.
So interior triangles correspond one-to-one with -element subsets of the points:
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Geometry, Chapter 11: Circles
- Intermediate Counting & Probability, Chapter 4: Constructive Counting and 1-1 Correspondences (§4.4, §4.5, §4.6)
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.