Why does this text insist on changing the variable name here?

In What is mathematics? by Courant, Robbins, and Stewart, "5. An important inequality", the authors change $n$ in this example:

$$(1+p)^n\geq1+np$$

to $r$ in this example:

$$(1+p)^r\geq1+rp$$

In other examples given by the book's author, he also switches the variable. I also recall seeing something similar in some other book. Why would one do that?

-
Well, for example to stress the extremely low importance of what letter we use to denote some variable/unknown , something some students have big trouble with sometimes. – DonAntonio Aug 15 '12 at 13:11
This switch is only for that? – Voyska Aug 15 '12 at 13:14
Maybe he is reffering to $r$ as a real number. In which case this inequality also holds. It holds for $r \geq 1$ and $r \leq 0$. – clark Aug 15 '12 at 13:18
I kinda see variables as if they were placeholders, like $\diamond^\diamond$ even if they are $x^y$, $z^g$, $p^o$, etc. I just thought this switch was some standard mathematical method intended to mean something else. – Voyska Aug 15 '12 at 13:20
@clark Here it is used in an argument where $n$ and $r$ both represent only integers. That is also another common reason, though. – process91 Aug 15 '12 at 13:31

Courant & Robbins' style in that book was to reserve the letter $n$ in an inductive argument for the general case, like this:

We want to prove that some statement $P(n)$ is true for all natural numbers $n$.

First we prove that it is true for $P(0)$.

Now we assume it is true for some natural number $r$, and we will prove it must also be true for $r+1$. That is, we will show $P(r)\implies P(r+1)$.

Here the authors are trying to make explicit the idea that $n$ represents any natural number, and in their induction step they are choosing one particular natural number $r$. This is simply the way that induction is introduced in the book at the top of page 11.

The essential idea in the preceding arguments is to establish a general theorem $A$ for all values of $n$ by successively proving a sequence of special cases, $A_1, A_2, \dots$ . The possibility of doing this depends on two things: a) There is a general method for showing that if any statement $A_r$ is true then the next statement, $A_{r+1}$, will also be true. b) The first statement $A_1$ is known to be true.

Once you are comfortable with this idea, many people simply use $n$ in the second step as well, remembering that in that second step $n$ represents a particular natural number.

-
Oh. Is this mentioned somewhere in the book? – Voyska Aug 15 '12 at 13:23
@GustavoBandeira It is how they present induction on page 11. Look at the quote I added above, as well as the theorem they provide further down on that page. – process91 Aug 15 '12 at 13:31
I've imagined it was something like this, I was just afraid because it seemed so obvious. – Voyska Aug 15 '12 at 13:53
It seems you're almost in the same position I am: "(Future) graduate student in math at UMass Amherst." I'll enter a graduation course on Mathematics in the near future. – Voyska Aug 15 '12 at 13:55
@GustavoBandeira Congrats! What is Mathematics is a wonderful book - one of my favorites. – process91 Aug 15 '12 at 14:11

The authors are proving this by induction. They switch from $n$ to $r$ to help readers who would be confused if they assumed something for $n$ when they're trying to prove it in the first place. So they assume the result for $r$ and show how to extend it to $r+1$, thus proving it for all $n$. No big deal.

-