Difference between revisions of "2017 AMC 10A Problems/Problem 23"
(→Solution) |
(→Solution) |
||
| Line 4: | Line 4: | ||
<math>\textbf{(A)}\ 2128 \qquad\textbf{(B)}\ 2148 \qquad\textbf{(C)}\ 2160 \qquad\textbf{(D)}\ 2200 \qquad\textbf{(E)}\ 2300</math> | <math>\textbf{(A)}\ 2128 \qquad\textbf{(B)}\ 2148 \qquad\textbf{(C)}\ 2160 \qquad\textbf{(D)}\ 2200 \qquad\textbf{(E)}\ 2300</math> | ||
| − | ==Solution== | + | ==Solution 1== |
There are a total of <math>\binom{25}{3}=2300</math> sets of three points. However, some of them form degenerate triangles (i.e., they have area of 0) if the three points are collinear. There are a total of 12 lines that go through 5 points (5 vertical, 5 horizontal, 2 diagonal), which contributes <math>\binom{5}{3} \cdot 12 = 120</math> degenerate triangles, 4 lines that go through exactly 4 points, which contributes <math>\binom{4}{3} \cdot 4 = 16</math> degenerate triangles, and 16 lines that go through exactly three points, which contributes <math>\binom{3}{3} \cdot 16 = 16</math> degenerate triangles. Subtracting these degenerate triangles, we get an answer of <math>2300-120-16-16=2300-152=\boxed{\textbf{(B) }2148}</math>. | There are a total of <math>\binom{25}{3}=2300</math> sets of three points. However, some of them form degenerate triangles (i.e., they have area of 0) if the three points are collinear. There are a total of 12 lines that go through 5 points (5 vertical, 5 horizontal, 2 diagonal), which contributes <math>\binom{5}{3} \cdot 12 = 120</math> degenerate triangles, 4 lines that go through exactly 4 points, which contributes <math>\binom{4}{3} \cdot 4 = 16</math> degenerate triangles, and 16 lines that go through exactly three points, which contributes <math>\binom{3}{3} \cdot 16 = 16</math> degenerate triangles. Subtracting these degenerate triangles, we get an answer of <math>2300-120-16-16=2300-152=\boxed{\textbf{(B) }2148}</math>. | ||
| + | |||
| + | ==Solution 2== | ||
| + | We can find out that the least number of digits the number <math>N</math> is <math>142</math>, with <math>141</math> <math>9</math>'s | ||
==See Also== | ==See Also== | ||
{{AMC10 box|year=2017|ab=A|num-b=22|num-a=24}} | {{AMC10 box|year=2017|ab=A|num-b=22|num-a=24}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 17:59, 9 February 2017
Contents
Problem
How many triangles with positive area have all their vertices at points 
in the coordinate plane, where 
and 
are integers between 
and 
, inclusive?
Solution 1
There are a total of 
sets of three points. However, some of them form degenerate triangles (i.e., they have area of 0) if the three points are collinear. There are a total of 12 lines that go through 5 points (5 vertical, 5 horizontal, 2 diagonal), which contributes 
degenerate triangles, 4 lines that go through exactly 4 points, which contributes 
degenerate triangles, and 16 lines that go through exactly three points, which contributes 
degenerate triangles. Subtracting these degenerate triangles, we get an answer of 
.
Solution 2
We can find out that the least number of digits the number 
is 
, with 
's
See Also
| 2017 AMC 10A (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 AMC 10 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
