AMC 10 Step by Step

2019 AMC 10A Problem 10

P1-10~3 minPrint

A rectangular floor that is 1010 feet wide and 1717 feet long is tiled with 170170 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?

Log in to save your progress.
Show solution without answering

Key insight

Each grid line crossed means a new tile. The bug crosses 16 lines one way and 9 the other, never two at once, so it visits 26 tiles.

Solution

Think about what happens as the bug walks: it stays in one tile until it crosses a grid line, and then it is in a new tile. So

tiles visited=1 (the starting tile)+number of grid lines crossed,\text{tiles visited} = 1 \text{ (the starting tile)} + \text{number of grid lines crossed},

as long as the bug never crosses two lines at the same moment (by walking exactly through a corner where four tiles meet).

  1. Lines across the length. The floor is 1717 feet long, so going along the length there are 17−1=1617 - 1 = 16 grid lines between the end walls. The bug crosses each one once.
  2. Lines across the width. The floor is 1010 feet wide, so there are 10−1=910 - 1 = 9 grid lines between the side walls. The bug crosses each one once.
  3. Does it ever hit a corner? Put the start at (0,0)(0,0) and the end at (17,10)(17,10). A point on the path is 1717 parts across for every 1010 parts up. To hit a tile corner, both coordinates must be whole numbers at once, and since 1717 and 1010 have no common factor other than 11, that only happens at the start and the end. So all crossings happen at different moments.
  4. Count. 16+9=2516 + 9 = 25 crossings, so the bug visits 1+25=261 + 25 = 26 tiles.

The answer is (C) 26\boxed{\textbf{(C)}\ 26}.

Why this works

"New tile each time you cross a line" turns a picture into a count. The one thing that could spoil it is walking exactly through a corner, where two crossings happen at once and only one new tile is entered. For a floor mm by nn whose sides share no common factor, that never happens and the answer is m+n−1m + n - 1. If they do share a factor, subtract one tile for each corner the path passes through.

Alternative approach

Check the rule on a tiny floor you can draw: a 2×32 \times 3 floor. The diagonal crosses 22 lines one way and 11 the other, and visits 1+3=41 + 3 = 4 tiles, which you can confirm by sketching. Using the same rule on 10×1710 \times 17 gives 10+17−1=2610 + 17 - 1 = 26.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

The bug starts in a corner tile. Every time its path crosses one of the interior grid lines it leaves one tile and enters a new one, so
tiles visited=1+(number of grid-line crossings),\text{tiles visited} = 1 + (\text{number of grid-line crossings}),
provided the path never passes through a corner where a vertical and a horizontal line meet (which would count one crossing for two lines).

Between the two 1010-foot walls there are 17−1=1617 - 1 = 16 interior vertical lines, and between the 1717-foot walls there are 10−1=910 - 1 = 9 interior horizontal lines. The diagonal passes through a lattice corner only at points (17t,10t)(17t, 10t) with both coordinates integers; since gcd⁡(10,17)=1\gcd(10, 17) = 1 that happens only at the two ends. So the 16+9=2516 + 9 = 25 crossings are all distinct.

Tiles visited: 1+25=261 + 25 = 26.

The answer is (C) 26\boxed{\textbf{(C)}\ 26}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.