AMC 10 Step by Step

2015 AMC 10B Problem 21

P21-25~6 minPrint

Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than 5 steps left). Suppose Dash takes 19 fewer jumps than Cozy to reach the top of the staircase. Let ss denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of ss ?

Log in to save your progress.
Show solution without answering

Key insight

Jump counts are steps divided by 2 or 5, rounded up. Their difference stays close to 3/10 of the steps, so only 62 to 66 need checking.

Solution

Step 1: how many jumps for nn steps?

Cozy jumps 22 steps at a time, with one short jump at the end if nn is odd. So for n=7n = 7 steps he needs 44 jumps: n÷2=3.5n \div 2 = 3.5, rounded up. Dash jumps 55 at a time, so for n=7n = 7 he needs 22 jumps: 7÷5=1.47 \div 5 = 1.4, rounded up.

So Cozy needs n÷2n \div 2 rounded up, and Dash needs n÷5n \div 5 rounded up. We want Cozy's count minus Dash's count to be 1919.

Step 2: narrow down nn.

Rounding up adds less than one jump. More exactly:
- Cozy's count is between n2\frac{n}{2} and n2+12\frac{n}{2} + \frac12.
- Dash's count is between n5\frac{n}{5} and n5+45\frac{n}{5} + \frac45.

Without rounding, the difference would be n2−n5=3n10\frac{n}{2} - \frac{n}{5} = \frac{3n}{10}. The rounding can push the difference up by at most 12\frac12 or down by at most 45\frac45. So
3n10−45≤19≤3n10+12.\frac{3n}{10} - \frac45 \le 19 \le \frac{3n}{10} + \frac12.
The right half gives 3n10≥18.5\frac{3n}{10} \ge 18.5, so n≥61.7n \ge 61.7. The left half gives 3n10≤19.8\frac{3n}{10} \le 19.8, so n≤66n \le 66. Only n=62,63,64,65,66n = 62, 63, 64, 65, 66 are possible.

Step 3: check each one.

nnCozy's jumpsDash's jumpsDifferenceWorks?
6262313113131818no
6363323213131919yes
6464323213131919yes
6565333313132020no
6666333314141919yes

Step 4: finish. The possible staircases have 6363, 6464 or 6666 steps, so s=63+64+66=193s = 63 + 64 + 66 = 193. Its digits add to 1+9+3=131 + 9 + 3 = 13.

The answer is (D) 13\boxed{\textbf{(D)}\ 13}.

Why this works

"Take a short jump at the end if needed" means dividing and rounding up. Rounding is hard to solve exactly, but it never changes a number by a whole jump, so the equation traps nn in a short range. Then a small table finishes the job. When a problem involves rounding up or down, first find a short range, then check every number in it.

Concise solution

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

For a staircase of nn steps, Cozy needs ⌈n/2⌉\lceil n/2 \rceil jumps and Dash needs ⌈n/5⌉\lceil n/5 \rceil jumps. We need
⌈n2⌉−⌈n5⌉=19.\left\lceil \frac{n}{2} \right\rceil - \left\lceil \frac{n}{5} \right\rceil = 19.

Bound the ceilings: n2≤⌈n/2⌉≤n2+12\frac{n}{2} \le \lceil n/2 \rceil \le \frac{n}{2} + \frac12 and n5≤⌈n/5⌉≤n5+45\frac{n}{5} \le \lceil n/5 \rceil \le \frac{n}{5} + \frac45. Subtracting,
3n10−45  ≤  19  ≤  3n10+12,\frac{3n}{10} - \frac45 \;\le\; 19 \;\le\; \frac{3n}{10} + \frac12,
so 18.5≤3n10≤19.818.5 \le \frac{3n}{10} \le 19.8, i.e. 61.7≤n≤6661.7 \le n \le 66. Only n=62,63,64,65,66n = 62, 63, 64, 65, 66 can work.

Check each:
- n=62n = 62: 31−13=1831 - 13 = 18. No.
- n=63n = 63: 32−13=1932 - 13 = 19. Yes.
- n=64n = 64: 32−13=1932 - 13 = 19. Yes.
- n=65n = 65: 33−13=2033 - 13 = 20. No.
- n=66n = 66: 33−14=1933 - 14 = 19. Yes.

So s=63+64+66=193s = 63 + 64 + 66 = 193, and the sum of its digits is 1+9+3=131 + 9 + 3 = 13.

The answer is (D) 13\boxed{\textbf{(D)}\ 13}.

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.