Induction, my first time; please be gentle.

In summary, the conversation discussed using induction to prove that for any integer n greater than or equal to 0, 5 is a divisor of 9^n - 4^n. The process involved using a base case and assuming the truth of the statement for n, then proving it for n+1. The proof involved factoring 5 from both terms and showing that the resulting expression was divisible by 5. The conversation also touched on properly writing the proof and the use of induction hypothesis.
  • #1
flyingpig
2,579
1

Homework Statement



I like this thing call induction

Prove that for every integer [tex]n\geq 0[/tex] that

[tex]5| (9^n - 4^n)[/tex]


The Attempt at a Solution



1) Base Case n = 0

[tex]9^0 - 4^0 = 0[/tex]

Clearly it is true

2) Take n = k + 1

[tex]9^{k + 1} - 4^{k + 1} = 9^k 9 - 4^k 4 = 9^k (4 + 5) - 4^k 4 = 9^k 5 + 9^k 4 - 4^k 4 = 9^k 5 + 4(9^k - 4^k)[/tex]

Now here is the problem. I know I did it correctly, but I don't know what to do with [tex]9^k 5 + 4(9^k - 4^k)[/tex] I know that 4 won't matter because I proved 1) and that 5 behind the 9^k would also disappear. But how do I formally say that?
 
Physics news on Phys.org
  • #2
flyingpig said:

Homework Statement



I like this thing call induction

Prove that for every integer [tex]n\geq 0[/tex] that

[tex]5| (9^n - 4^n)[/tex]


The Attempt at a Solution



1) Base Case n = 0

[tex]9^0 - 4^0 = 0[/tex]
90 - 40 = 5
flyingpig said:
Clearly it is true

2) Take n = k + 1

[tex]9^{k + 1} - 4^{k + 1} = 9^k 9 - 4^k 4 = 9^k (4 + 5) - 4^k 4 = 9^k 5 + 9^k 4 - 4^k 4 = 9^k 5 + 4(9^k - 4^k)[/tex]

Now here is the problem. I know I did it correctly, but I don't know what to do with [tex]9^k 5 + 4(9^k - 4^k)[/tex] I know that 4 won't matter because I proved 1) and that 5 behind the 9^k would also disappear. But how do I formally say that?
You seem to be missing your induction hypothesis; i.e., that 5 | 9k - 4k. Another way to say this is that 9k - 4k = 5M for some integer M.
 
  • #3
Mark44 said:
90 - 40 = 5
;;;
No.
 
  • #4
Scratch that - you were right. I think it's getting late.

Anyway, by the Induction Hypothesis, you know that 9k - 4k is divisible by 5, which means that 9k - 4k = 5M for some integer M.

The rest of the proof hinges on showing that 9k + 1 - 4k + 1 can be related back to 9k - 4k in some way.

9k + 1 - 4k + 1 = 9*9k - 4*4k
= 4*9k - 4*4k + 5*9k

Hopefully, you can do something with that.
 
  • #5
Even with 9k - 4k = 5M, I don't know what to do with

4*(9k - 4k) + 5*9k
 
  • #6
4*(9k - 4k) + 5*9k = 4* 5M + 5*9k

Can you show that this last expression is divisible by 5?
 
  • #7
flyingpig said:
Even with 9k - 4k = 5M, I don't know what to do with

4*(9k - 4k) + 5*9k

Your first term is divisible by 5 from the induction hypothesis. Your second term is divisible by 5 just by looking at it. So the sum is divisible by 5. Yes?
 
  • #8
Dick said:
Your first term is divisible by 5 from the induction hypothesis. Your second term is divisible by 5 just by looking at it. So the sum is divisible by 5. Yes?

Yeah but I don't know how to write it properly.
 
  • #9
Look at the expression on the right side of the equation in post #6. Factor 5 from each term.
 
  • #10
flyingpig said:
Yeah but I don't know how to write it properly.

4*5*M+5*9^k=5*(4*M+9^k). That's 5 times an integer. I'm pretty sure anyone would believe that is divisible by 5. I'm not sure what you mean by 'write it properly'.
 
  • #11
1) Base Case n = 0

[tex]S(n): 9^n - 4^n[/tex]

[tex]9^0 - 4^0 = 0[/tex]

Clearly it is true

2) Assume that [tex]5|(9^n - 4^n)[/tex] is true, then we can show that S(n + 1) is also true, i.e.

[tex]S(n + 1) = 9^{n + 1} - 4^{n + 1} = 5M[/tex] (1) [Would it better to write [tex]5| 9^{n + 1} - 4^{n + 1}[/tex] instead because it is confusing with what is below?]

Assuming that S(n) is true, then [tex]\exists M \in \mathbb{Z}[/tex] such that

[tex]9^n - 4^n = 5M[/tex]

Thus

[tex]9^{n + 1} - 4^{n + 1} = 9^n 9 - 4^n 4 = 9^n (4 + 5) - 4^n 4 = 9^n 5 + 9^n 4 - 4^n 4 = 9^n 5 + 4(9^n - 4^n) = 5M + 4^n + 4(5M) = 25M + 4^n[/tex]

Since [tex]25M + 4^n \in \mathbb{Z}[/tex], it is clear that (1) is true by the Principles of Mathematical Induction.

Q.E.D.
 

FAQ: Induction, my first time; please be gentle.

What is induction?

Induction is a logical process of reasoning in which specific observations or premises are used to make generalizations or predictions.

Why is induction important in science?

Induction is important in science because it allows for the development of hypotheses and theories based on observations and data, which can then be tested and refined through further experimentation.

How does induction differ from deduction?

Induction involves reasoning from specific cases to general principles, whereas deduction involves reasoning from general principles to specific cases. In other words, induction is used to develop theories, while deduction is used to test them.

What are some limitations of induction?

Some limitations of induction include the possibility of drawing incorrect conclusions from limited or biased data, as well as the fact that induction cannot prove a theory or hypothesis to be true, only support it. Additionally, new evidence may contradict previously drawn conclusions.

How can I ensure the validity of my induction?

To ensure the validity of induction, it is important to use a large and diverse sample of data, consider alternative explanations for the observed patterns, and test the theory or hypothesis through further experimentation. It is also important to be aware of any potential biases that may affect the interpretation of the data.

Similar threads

Back
Top