Difference between revisions of "2017 AMC 10A Problems/Problem 10"
(→Solution) |
(→Solution) |
||
Line 4: | Line 4: | ||
<math>\textbf{(A)}\ 16\qquad\textbf{(B)}\ 17\qquad\textbf{(C)}\ 18\qquad\textbf{(D)}\ 19\qquad\textbf{(E)}\ 20</math> | <math>\textbf{(A)}\ 16\qquad\textbf{(B)}\ 17\qquad\textbf{(C)}\ 18\qquad\textbf{(D)}\ 19\qquad\textbf{(E)}\ 20</math> | ||
− | ==Solution== | + | ==Solution 1== |
The triangle inequality generalizes to all polygons, so <math>x < 3+7+15</math> and <math>15<x+3+7</math> yields <math>5<x<25</math>. Now, we know that there are <math>19</math> numbers between <math>5</math> and <math>25</math> exclusive, but we must subtract <math>2</math> to account for the 2 lengths already used that are between those numbers, which gives <math>19-2=\boxed{\textbf{(B)}\ 17}</math> | The triangle inequality generalizes to all polygons, so <math>x < 3+7+15</math> and <math>15<x+3+7</math> yields <math>5<x<25</math>. Now, we know that there are <math>19</math> numbers between <math>5</math> and <math>25</math> exclusive, but we must subtract <math>2</math> to account for the 2 lengths already used that are between those numbers, which gives <math>19-2=\boxed{\textbf{(B)}\ 17}</math> | ||
+ | |||
+ | ==Solution 2== | ||
+ | The quadrilateral inequality states that <math>a+b+c \ge d</math>, where <math>a,b,c,</math> and <math>d</math> and the side lengths, and <math>d</math> is the largest one. Now, we can just plug these values in. We have <math>2</math> cases. First if this other side length (we will call it <math>x</math>) is the largest side length we have: <cmath>3+7+15 \ge x \rightarrow 25 \ge x</cmath>, so there are <cmath>25,26,27,28,29,30</cmath>, so <math>6</math> values. Now, we have case <math>2</math> which is if <math>15</math> is the largest side length. We can say that <cmath>3+7+x \ge 15 \rightarrow 10+x \ge 15</cmath>, so we have the lower bound to be <math>5</math> and the upper bound to be <math>15</math>, so we have <math>15-5+1 = 11</math> values for this case. When adding these <math>2</math> cases we get a total of <math>11+6 = \boxed{\textbf{(B)}\ 17}</math> | ||
==Video Solution== | ==Video Solution== |
Revision as of 17:23, 29 December 2024
Problem
Joy has thin rods, one each of every integer length from cm through cm. She places the rods with lengths cm, cm, and cm on a table. She then wants to choose a fourth rod that she can put with these three to form a quadrilateral with positive area. How many of the remaining rods can she choose as the fourth rod?
Solution 1
The triangle inequality generalizes to all polygons, so and yields . Now, we know that there are numbers between and exclusive, but we must subtract to account for the 2 lengths already used that are between those numbers, which gives
Solution 2
The quadrilateral inequality states that , where and and the side lengths, and is the largest one. Now, we can just plug these values in. We have cases. First if this other side length (we will call it ) is the largest side length we have: , so there are , so values. Now, we have case which is if is the largest side length. We can say that , so we have the lower bound to be and the upper bound to be , so we have values for this case. When adding these cases we get a total of
Video Solution
~savannahsolver
See Also
2017 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.