Solution:
Let "a 3" mean a move in which Crisp moves from x to x+3, and "a 7" mean a move in which Crisp moves from x to x+7. Note that Crisp stops precisely the first time his number of 3's and number of 7's differs by a multiple of 5, and that he'll stop on a dime if they differ by 0, and stop on a nickel if they differ by 5. This fact will be used without justification.
We split into two cases:
a. Crisp begins with a 3. Rather than consider the integer Crisp is on, we'll count the difference, n, between his number of 3's and his number of 7's. Each 3 increases n by 1, and each 7 decreases n by 1. Currently, n is 1. The probability of stopping on a dime, then, is the probability n reaches 0 before n reaches 5, where n starts at 1. Let ai be the probability n reaches 0 first, given a current position of i, for i=1,2,3,4. We desire a1. We have the system of linear equations
a1a2a3a4=32a2+31⋅1=32a3+31a1=32a4+31a2=32⋅0+31a3
From which we determine that a1=3115.
b. Crisp begins with a 7. Now, let m be the difference between his number of 7's and his number of 3's. Let bi denote his probability of stopping on a dime, given his current position of m=i. We desire b1. We have the system of linear equations
b1b2b3b4=31b2+32⋅1=31b3+32b1=31b4+32b2=31⋅0+32b3
From which we determine that b1=3130.
We conclude that the answer is 32a1+31b1=32⋅3115+31⋅3130=3120.