Difference between revisions of "2002 AMC 12B Problems/Problem 14"
(→Problem) |
(→Solution 2) |
||
| Line 4: | Line 4: | ||
== Solution 1== 6 | == Solution 1== 6 | ||
| − | ==Solution 2== | + | ==Solution 2== 6 |
| − | |||
==Solution 3== | ==Solution 3== | ||
Revision as of 21:09, 3 June 2021
- The following problem is from both the 2002 AMC 12B #14 and 2002 AMC 10B #18, so both problems redirect to this page.
Problem
== Solution 1== 6
==Solution 2== 6
Solution 3
Pick a circle any circle- 
ways. Then, pick any other circle- 
ways. For each of these circles, there will be 
intersections for a total of 
= 
intersections. However, we have counted each intersection twice, so we divide for overcounting. Therefore, we reach a total of 
, which corresponds to 
.
See also
| 2002 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 17 |
Followed by Problem 19 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AMC 10 Problems and Solutions | ||
| 2002 AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 13 |
Followed by Problem 15 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
