MHB How do you solve the recurrence relation P(n) = 1 + 5n by induction?

  • Thread starter Thread starter Fernando Revilla
  • Start date Start date
  • Tags Tags
    Recurrence Relation
Click For Summary
The recurrence relation P(n) = 1 + 5n is solved using mathematical induction. The base case shows that P(1) equals 1, confirming the formula. The induction step assumes the formula holds for n, then demonstrates it also holds for n+1 by showing P(n+1) equals P(n) + 5. This confirms that the closed form solution P(n) = 1 + 5n is valid for all n. The discussion effectively outlines the steps of induction to validate the recurrence relation.
Fernando Revilla
Gold Member
MHB
Messages
631
Reaction score
0
I quote a question from Yahoo! Answers

Solve P(n) = 1 + 5n by induction?
Closed form solution: P(n) = 1 + 5n
from, P(n) = {1 if n = 1
P(n-1) + 5 if n > 1}

I have given a link to the topic there so the OP can see my response.
 
Mathematics news on Phys.org
The recurrence relation is $p(n)=p(n-1)+5,\; p(1)=1$. Then, $p(n)=1+5n$ is a solution.

Basis Step $p(1)=1+5\cdot 0=1$.

Induction Step
Suppose the relation is true for $n$. Then, $p(n)=1+5n$, so
$$p(n+1)=1+5(n+1)=1+5n+5=p(n)+5$$

As a consqeuence, the relation is true for $n+1$.