An object is already moving at 13 pixels/sec at t=0, and every second the speed decreases to.. An object is already moving at 13 pixels/sec at t=0, and every second the speed decreases to x=0.95 the speed at t-1. Once the object is going at a speed less than or equal to 1 pixel/sec it stops (this takes 51 seconds, but if the problem can be solved without being given this information it would be better). The object MUST ONLY stop on an increment of 142 pixels. What would x have to be for the object to land exactly on the nearest 142 pixel increment?
I need to see how to do this in order to incorporate it into a program.
 A: First, I'm going to assume that the object slows down smoothly, and the function of the object's velocity is therefore $13x^t$, $t$ being time. To find the distance it travels, integrate it and you get
$$\frac{13x^t}{\ln x}+C$$
Because you want to find the distance starting from $t=0$, the function becomes ($C$ gets replaced)
$$\frac{13x^t}{\ln x}-\frac{13}{\ln x}$$
To find the distance until $v=1$ solve
$$1=13x^t$$
and you get
$$t=\frac{\ln 13}{\ln x}$$
Plug that in for $t$ and set it to equal $142$
$$\frac{13x^{-\frac{\ln 13}{\ln x}}-13}{\ln x}=142$$
and solve to get
$$x=\frac{1}{e^{\frac{6}{71}}}$$
which is approximately $0.919$
A: To put the problem in more mathematical terms, we have a geometric series which we can write as $$d(n) = v_0(1+x+\cdots + x^n),$$ with $d(n)$ refering to the total distance traveled at time $n$. If we let $N$ be the first value for which $v_0 x^N \leq 1$, we're requiring that $d(N)$ be a multiple of $142$. 
I don't know if there is an elegant solution to this problem. So why not simply use a guess and check approach? Here's a little Mathematica code: 
v[0] = 13;
x = .9206;
n = 0;
d = 0;
While[v[0] x^n > 1, d = d + v[0] x^n; n++]
Print[d]
Print[n]
By trying out different values for $x$, I found .9206 to be a good approximation. And of course you can keep on narrowing in until you get as good an approximation as you want. Hope this is the kind of solution you have in mind!
