Difference between revisions of "2019 AMC 10A Problems/Problem 10"
(→Solution) |
(→Solution) |
||
Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
− | Because this is a <math>10</math> by <math>17</math> grid, the number of tiles that the bug visits is <math>10+17-1=26\implies | + | Because this is a <math>10</math> by <math>17</math> grid, the number of tiles that the bug visits is <math>10+17-1=26\implies C</math>. |
Note: You will find that the general formula for this is <math>a+b-lcm(a,b)</math> | Note: You will find that the general formula for this is <math>a+b-lcm(a,b)</math> |
Revision as of 18:58, 9 February 2019
Problem
A rectangular floor that is feet wide and feet long is tiled with one-foot square tiles. A bug walks from one corner to the opposite corner in a straight line. Including the first and the last tile, how many tiles does the bug visit?
Solution
Because this is a by grid, the number of tiles that the bug visits is .
Note: You will find that the general formula for this is
See Also
2019 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.