
Proving by induction
Can anyone help me get started on this math problem? I understand what the problem is purposing and I already know that it is indeed true, but how do I prove it?
Suppose there is a circular auto track that is one mile long. Along the track there are n > 0
gas stations. The combined amount of gas in all gas stations allows a car to travel exactly one
mile. A car has a gas tank that will hold a lot more than needed to get around the track once, but it starts out empty.
Show that no matter how the gas stations are placed, there is a starting point for the car such
that it can go around the track once (clockwise) without running out of gas.
Thanks

Re: Proving by induction
Without loss of generality, let us label the gas stations $\displaystyle a_1, a_2, ... a_n$, where $\displaystyle a_1$ holds the most amount of gas $\displaystyle a_2$ holds the second most amount, and so on. I'm only focusing on the 'worst' case as well, in other words, that all the gas stations hold exactly the required amount to go around the track once.
We are given that
$\displaystyle \sum_{i=1}^{n} a_i = 1$
We know that the base case, n=1, is true. If there is one gas station on the track, then we place the car right at the gas station.
Then we can invoke the induction step that if we have n gas stations, then we can place the car somewhere on the track and it will go around the track once.
Now we have to prove P(n+1), that is to say that if we have n+1 gas stations then we have to prove that we can place the car somewhere on the track and it will go around the track once. careful, however.
For this step we can only assume
$\displaystyle \sum_{i=1}^{n+1} a_i = 1$ (S1) not $\displaystyle \sum_{i=1}^{n} a_i = 1$
However, we do know that by (S1) $\displaystyle \sum_{i=1}^{n} a_i = 1  a_{n+1}$. However, since we ordered the gas stations we know that "$\displaystyle a_{n+1}$ holds the least amount of gas amongst all the other gas stations." (S2)
and from here I don't know how to be more rigorous to prove that this is enough to show that the car can go around the track exactly once... but at least it's a start.
EDIT: I want to say something like "No matter where you put gas station $\displaystyle a_{n+1}$, the car will reach $\displaystyle a_{n+1}$ with the amount of gas that it has stored on its trip." with proof invoking (S1), (S2) and our induction step assumption.