How Do You Prove a Recursive Sequence Using Strong Induction?

In summary, the conversation is about using strong induction to prove a recursive sequence and the goal is to prove that the sequence is always less than 5 to the power of n. The base step is true and the induction step is proved by showing that if it is true for n and n-1, it is also true for n+1. This is done by using the values of f(n) and f(n-1) and doing arithmetic to show that f(n+1) is also less than 5 to the power of n+1.
  • #1
andrew1
20
0
Hi,

I'm currently having trouble with using strong induction to prove a recursive sequence and don't know where to begin, any help would be great thanks.

Define a recursive sequence f(0), f(1), f(2),... by
f(0) = 0
f(1) = 1
f(n+1) = 3f(n) + 10f(n-1), for all integers n>=1

Prove by strong induction that f(n) < 5^n for all integers n>=0
 
Physics news on Phys.org
  • #2
andrew said:
Hi,

I'm currently having trouble with using strong induction to prove a recursive sequence and don't know where to begin, any help would be great thanks.

Define a recursive sequence f(0), f(1), f(2),... by
f(0) = 0
f(1) = 1
f(n+1) = 3f(n) + 10f(n-1), for all integers n>=1

Prove by strong induction that f(n) < 5^n for all integers n>=0

because f(1) < $5^1$ and f(0) = 0 <5 $^0$ base step is true

now we need to prove the induction step

$f(n ) < 5^n$
$f(n-1 ) < 5^{n-1}$
f(n+2) = 3 f(n) + 10 f(n-1)

< $3 * 5^n + 10 * 5^{n-1}$
< $3 * 5^n + 2 * 5^n$
< $5 * 5^n $
< $5^{n+1}$

so if it true for n and n-1 it is true for n+ 1
so induction step is proved
hence proved
 
Last edited:
  • #3
Thank you, but I'm confused as to how you arrived at that conclusion, could you provide a description of the process that you went through for each of the steps please.
 
  • #4
andrew said:
Thank you, but I'm confused as to how you arrived at that conclusion, could you provide a description of the process that you went through for each of the steps please.
can you explain in which step there was confusion.
 
  • #5
kaliprasad said:
can you explain in which step there was confusion.

This part doesn't make much sense to me

< $3 * 5^n + 10 * 5^{n-1}$
< $3 * 5^n + 2 * 5^n$
< $5 * 5^n $
< $5^{n+1}$
 
  • #6
andrew said:
This part doesn't make much sense to me

< $3 * 5^n + 10 * 5^{n-1}$
< $3 * 5^n + 2 * 5^n$
< $5 * 5^n $
< $5^{n+1}$

OK \:
we have f(n) < $5^n$so 3 f( n) < 3 * 5^n

f(n-1) < $5^{n-1}$ it is true upto n so for all lower values

so f(n+1) = 3f(n) + 10 f(n-1)
< $3 * 5^n + 10 * 5^{n-1}$ (adding last 2)
< $3 * 5^n + 2 * 5 * 5^{n-1}$ (as 10 -= 2 * 5)
< $3 * 5^n + 2 * 5^n$
< $(3 + 2) * 5^n$
< $5 * 5^n$
< $5^{n+1}$

I hope now all steps are clear. I have just put the values and did arithmetic
 
  • #7
kaliprasad said:
OK \:
we have f(n) < $5^n$so 3 f( n) < 3 * 5^n

f(n-1) < $5^{n-1}$ it is true upto n so for all lower values

so f(n+1) = 3f(n) + 10 f(n-1)
< $3 * 5^n + 10 * 5^{n-1}$ (adding last 2)
< $3 * 5^n + 2 * 5 * 5^{n-1}$ (as 10 -= 2 * 5)
< $3 * 5^n + 2 * 5^n$
< $(3 + 2) * 5^n$
< $5 * 5^n$
< $5^{n+1}$

I hope now all steps are clear. I have just put the values and did arithmetic

Hmmk, makes more sense now, strong induction always seems to confuse me :(
 

FAQ: How Do You Prove a Recursive Sequence Using Strong Induction?

What is recursion and how is it used in computer science?

Recursion is a programming technique where a function calls itself in order to solve a smaller version of the problem. It is commonly used in computer science for tasks that require repetitive and nested operations, such as sorting and searching algorithms.

What is the difference between recursion and iteration?

Recursion and iteration are both methods for repeating a process in a program, but they differ in how they are implemented. Recursion involves calling a function within itself, while iteration uses loops to repeatedly execute a block of code.

What is the principle of strong induction?

Strong induction is a proof technique used to prove statements about natural numbers. It involves showing that a statement is true for a base case, and then showing that if the statement is true for all values less than a given number, it must also be true for that number. This differs from regular induction, which only requires the statement to be true for the previous number.

How is strong induction used in computer science?

In computer science, strong induction is commonly used to prove the correctness of recursive algorithms. By showing that the algorithm produces the correct result for smaller inputs, it can be concluded that it will also produce the correct result for larger inputs.

What are some common examples of problems that can be solved using recursion?

Some common examples of problems that can be solved using recursion include calculating the factorial of a number, traversing a binary tree, and finding the shortest path in a graph. Recursive solutions can also be used for divide and conquer algorithms, such as merge sort and quicksort.

Similar threads

Replies
2
Views
3K
Replies
5
Views
3K
Replies
18
Views
2K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
1
Views
5K
Replies
11
Views
886
Replies
2
Views
2K
Replies
4
Views
1K
Back
Top