I've attempted to solve another AMC 10 problem, and the problem is basically like this:
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 the Dash takes $19$ fewer jumps than Cozy to reach the top of the staircase. Let $s$ denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of $s$?
I see that they've used the Gauss sign in solutions, but there are a few parts of it that I don't understand. (I do know that in Gauss sign if [n], then it could be n or larger, but no larger than n+1).
In solution 1, when they first state that [s/2]-19 = [s/5], I don't think it'd work all the time - or would it? And in case 2 (solution 1), they say it's [s/2]=s/2 + 1/2, but shouldn't it rather be s/2+1 ?
And in truth, I don't quite know how to solve this problem, and I do think there are ways to solve it without Gauss signs. Anyone have any ideas?