Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2017 AMC 10A Problems/Problem 23"

(→‎Solution)
(→‎Solution 2)
Line 8: Line 8:
  
 
==Solution 2==
 
==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
+
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 and one <math>5</math>.
 +
By randomly mixing the digits up, we are likely to get: <math>9999</math>...<math>9995999</math>...<math>9999</math>.
 +
By adding 1 to this number, we get: <math>9999</math>...<math>9996000</math>...<math>0000</math>.
 +
We can subtract 6 from every available choice, and see if the number is divisible by 9 afterwards.
 +
After subtracting 6 from every number, we can conclude that <math>1233</math> (originally <math>1239</math>) is the only number divisible by 9.
 +
So our answer is <math>1239</math>
  
 
==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 19:04, 9 February 2017

Problem

How many triangles with positive area have all their vertices at points $(i,j)$ in the coordinate plane, where $i$ and $j$ are integers between $1$ and $5$, inclusive?

$\textbf{(A)}\ 2128 \qquad\textbf{(B)}\ 2148 \qquad\textbf{(C)}\ 2160 \qquad\textbf{(D)}\ 2200 \qquad\textbf{(E)}\ 2300$

Solution 1

There are a total of $\binom{25}{3}=2300$ 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 $\binom{5}{3} \cdot 12 = 120$ degenerate triangles, 4 lines that go through exactly 4 points, which contributes $\binom{4}{3} \cdot 4 = 16$ degenerate triangles, and 16 lines that go through exactly three points, which contributes $\binom{3}{3} \cdot 16 = 16$ degenerate triangles. Subtracting these degenerate triangles, we get an answer of $2300-120-16-16=2300-152=\boxed{\textbf{(B) }2148}$.

Solution 2

We can find out that the least number of digits the number $N$ is $142$, with $141$ $9$'s and one $5$. By randomly mixing the digits up, we are likely to get: $9999$...$9995999$...$9999$. By adding 1 to this number, we get: $9999$...$9996000$...$0000$. We can subtract 6 from every available choice, and see if the number is divisible by 9 afterwards. After subtracting 6 from every number, we can conclude that $1233$ (originally $1239$) is the only number divisible by 9. So our answer is $1239$

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_23&oldid=83373"