Difference between revisions of "2021 Fall AMC 12B Problems/Problem 19"
Cellsecret (talk | contribs) (→Solution 1) |
m (→Solution) |
||
| Line 5: | Line 5: | ||
<math>(\textbf{A})\: 52\qquad(\textbf{B}) \: 56\qquad(\textbf{C}) \: 60\qquad(\textbf{D}) \: 64\qquad(\textbf{E}) \: 68</math> | <math>(\textbf{A})\: 52\qquad(\textbf{B}) \: 56\qquad(\textbf{C}) \: 60\qquad(\textbf{D}) \: 64\qquad(\textbf{E}) \: 68</math> | ||
| − | ==Solution | + | ==Solution== |
Imagine we have <math>2</math> regular polygons with <math>m</math> and <math>n</math> sides and <math>m>n</math> inscribed in a circle without sharing a vertex. We see that each side of the polygon with <math>n</math> sides (the polygon with fewer sides) will be intersected twice. | Imagine we have <math>2</math> regular polygons with <math>m</math> and <math>n</math> sides and <math>m>n</math> inscribed in a circle without sharing a vertex. We see that each side of the polygon with <math>n</math> sides (the polygon with fewer sides) will be intersected twice. | ||
(We can see this because to have a vertex of the m-gon on an arc subtended by a side of the n-gon, there will be one intersection to “enter” the arc and one to “exit” the arc. ~KingRavi) | (We can see this because to have a vertex of the m-gon on an arc subtended by a side of the n-gon, there will be one intersection to “enter” the arc and one to “exit” the arc. ~KingRavi) | ||
| Line 21: | Line 21: | ||
~kingofpineapplz | ~kingofpineapplz | ||
| + | |||
==Video Solution by Interstigation== | ==Video Solution by Interstigation== | ||
https://youtu.be/7cfZwwYSttQ | https://youtu.be/7cfZwwYSttQ | ||
Revision as of 23:54, 12 June 2022
- The following problem is from both the 2021 Fall AMC 10B #21 and 2021 Fall AMC 12B #19, so both problems redirect to this page.
Problem
Regular polygons with 
and 
sides are inscribed in the same circle. No two of the polygons share a vertex, and no three of their sides intersect at a common point. At how many points inside the circle do two of their sides intersect?
Solution
Imagine we have 
regular polygons with 
and 
sides and 
inscribed in a circle without sharing a vertex. We see that each side of the polygon with sides (the polygon with fewer sides) will be intersected twice.
(We can see this because to have a vertex of the m-gon on an arc subtended by a side of the n-gon, there will be one intersection to “enter” the arc and one to “exit” the arc. ~KingRavi)
This means that we will end up with times the number of sides in the polygon with fewer sides.
If we have polygons with and sides, we need to consider each possible pair of polygons and count their intersections.
Throughout 6 of these pairs, the 
-sided polygon has the least number of sides 
times, the 
-sided polygon has the least number of sides times, and the 
-sided polygon has the least number of sides 
time.
Therefore the number of intersections is 
.
~kingofpineapplz
Video Solution by Interstigation
~Interstigation
See Also
| 2021 Fall AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 20 |
Followed by Problem 22 | |
| 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 | ||
| 2021 Fall AMC 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 18 |
Followed by Problem 20 |
| 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. 
