Difference between revisions of "2016 AMC 10B Problems/Problem 14"
(→Problem) |
Pixelpyguy (talk | contribs) (→Video Solution) |
||
(19 intermediate revisions by 10 users not shown) | |||
Line 9: | Line 9: | ||
\textbf{(E)}\ 57</math> | \textbf{(E)}\ 57</math> | ||
+ | ==Solution 1== | ||
+ | The region is a right triangle which contains the following lattice points: | ||
+ | <math>(0,0); (1,0)\rightarrow(1,3); (2,0)\rightarrow(2,6); (3,0)\rightarrow(3,9); (4,0)\rightarrow(4,12); (5,0)\rightarrow(5,15)</math> | ||
− | ==Solution== | + | <asy>size(10cm); |
+ | for(int i=0;i<6;++i)for(int j=0;j<=3*i;++j)dot((i,j)); | ||
+ | draw((0,-1)--(0,16),EndArrow);draw((-1,0)--(6,0),EndArrow); | ||
+ | draw((-.5,-pi/2)--(5.2,5.2*pi),gray);draw((-1,-.1)--(6,-.1)^^(5.1,-1)--(5.1,16),gray); | ||
+ | </asy> | ||
+ | |||
+ | Squares <math>1\times 1</math>: | ||
+ | Suppose that the top-right corner is <math>(x,y)</math>, with <math>2\le x\le 5</math>. Then to include all other corners, we need <math>1\le y\le 3(x-1)</math>. | ||
+ | This produces <math>3+6+9+12=30</math> squares. | ||
+ | |||
+ | Squares <math>2\times 2</math>: | ||
+ | Here <math>3\le x\le 5</math>. To include all other corners, we need <math>2\le y\le 3(x-2)</math>. | ||
+ | This produces <math>2+5+8=15</math> squares. | ||
+ | |||
+ | Squares <math>3\times 3</math>: | ||
+ | Similarly, this produces <math>5</math> squares. | ||
+ | |||
+ | No other squares will fit in the region. Therefore the answer is <math>\boxed{\textbf{(D) }50}</math>. | ||
+ | |||
+ | ==Solution 2== | ||
+ | |||
+ | The vertical line is just to the right of <math>x = 5</math>, the horizontal line is just under <math>y = 0</math>, and the sloped line will always be above the <math>y</math> value of <math>3x</math>. | ||
+ | This means they will always miss being on a coordinate with integer coordinates so you just have to count the number of squares to the left, above, and under these lines. After counting the number of <math>1\cdot1</math>, <math>2\cdot2</math>, and <math>3\cdot3</math> squares and getting <math>30</math>, <math>15</math>, and <math>5</math> respectively, and we end up with <math>\boxed{\textbf{(D)}\ 50}</math>. | ||
+ | |||
+ | Solution by Wwang | ||
+ | |||
+ | == Solution 3== | ||
+ | |||
+ | The endpoint lattice points are <math>(1,3), (2,6), (3,9), (4,12), (5,15).</math> Now we split this problem into cases. | ||
+ | |||
+ | '''Case 1: Square has length <math>\bf1</math>.''' | ||
+ | |||
+ | The <math>x</math> coordinates must be <math>(1,2)</math> or <math>(2,3)</math> and so on to <math>(4,5).</math> The idea is that you start at <math>y=1</math> and add at the endpoint, namely <math>y=3.</math> The number ends up being <math>3+6+9+12 = 30</math> squares for this case. | ||
+ | |||
+ | |||
+ | '''Case 2: Square has length <math>\bf2</math>.''' | ||
+ | |||
+ | The <math>x</math> coordinates must be <math>(1,3)</math> or <math>(2,4)</math> or <math>(3,15)</math> and so now it starts at <math>y=2.</math> It ends up being <math>2+5+8 = 15.</math> | ||
+ | |||
+ | '''Case 3: Square has length <math>\bf3</math>.''' | ||
+ | |||
+ | The <math>x</math> coordinates must be <math>(1,4)</math> or <math>(2,5)</math> so there is <math>1+4 = 5</math> squares for this case. | ||
+ | |||
+ | |||
+ | Therefore, <math>30+15+5 = \boxed{\textbf{(D)}\ 50}</math>. | ||
+ | |||
+ | ==Video Solution== | ||
+ | |||
+ | [https://www.youtube.com/watch?v=0CgqeYEARgA&ab_channel=RyanYang Video Solution by Ryan Yang] | ||
+ | ~pixelpyguy | ||
+ | |||
+ | ==See Also== | ||
+ | {{AMC10 box|year=2016|ab=B|num-b=13|num-a=15}} | ||
+ | {{MAA Notice}} |
Latest revision as of 07:50, 9 March 2024
Problem
How many squares whose sides are parallel to the axes and whose vertices have coordinates that are integers lie entirely within the region bounded by the line , the line and the line
Solution 1
The region is a right triangle which contains the following lattice points:
Squares : Suppose that the top-right corner is , with . Then to include all other corners, we need . This produces squares.
Squares : Here . To include all other corners, we need . This produces squares.
Squares : Similarly, this produces squares.
No other squares will fit in the region. Therefore the answer is .
Solution 2
The vertical line is just to the right of , the horizontal line is just under , and the sloped line will always be above the value of . This means they will always miss being on a coordinate with integer coordinates so you just have to count the number of squares to the left, above, and under these lines. After counting the number of , , and squares and getting , , and respectively, and we end up with .
Solution by Wwang
Solution 3
The endpoint lattice points are Now we split this problem into cases.
Case 1: Square has length .
The coordinates must be or and so on to The idea is that you start at and add at the endpoint, namely The number ends up being squares for this case.
Case 2: Square has length .
The coordinates must be or or and so now it starts at It ends up being
Case 3: Square has length .
The coordinates must be or so there is squares for this case.
Therefore, .
Video Solution
Video Solution by Ryan Yang ~pixelpyguy
See Also
2016 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
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.