Difference between revisions of "2018 AMC 8 Problems/Problem 23"
(→Solution 2 (Complementary)) |
m (→Solution) |
||
| Line 11: | Line 11: | ||
</asy> | </asy> | ||
| − | ==Solution== | + | ==Solution 1== |
We will use constructive counting to solve this. There are <math>2</math> cases: Either all <math>3</math> points are adjacent, or exactly <math>2</math> points are adjacent. | We will use constructive counting to solve this. There are <math>2</math> cases: Either all <math>3</math> points are adjacent, or exactly <math>2</math> points are adjacent. | ||
Revision as of 11:04, 29 July 2019
From a regular octagon, a triangle is formed by connecting three randomly chosen vertices of the octagon. What is the probability that at least one of the sides of the triangle is also a side of the octagon?
![[asy] size(3cm); pair A[]; for (int i=0; i<9; ++i) { A[i] = rotate(22.5+45*i)*(1,0); } filldraw(A[0]--A[1]--A[2]--A[3]--A[4]--A[5]--A[6]--A[7]--cycle,gray,black); for (int i=0; i<8; ++i) { dot(A[i]); } [/asy]](http://latex.artofproblemsolving.com/5/4/d/54d911c096b9c5403a914f8b8c2b05b4915494f1.png)
Solution 1
We will use constructive counting to solve this. There are 
cases: Either all 
points are adjacent, or exactly points are adjacent.
If all points are adjacent, then we have 
choices. If we have exactly adjacent points, then we will have places to put the adjacent points and also 
places to put the remaining point, so we have 
choices. The total amount of choices is 
.
Thus our answer is 
Solution 2 (Complementary)
We can decide adjacent points with choices. The remaining point will have 
choices. However, we have counted the case with adjacent points twice, so we need to subtract this case once. The case with the adjacent points has arrangements, so our answer is 
See Also
| 2018 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 22 |
Followed by Problem 24 | |
| 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 AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
