Induction, my first time; please be gentle.

  • Thread starter Thread starter flyingpig
  • Start date Start date
  • Tags Tags
    Induction Time
Click For Summary

Homework Help Overview

The discussion revolves around proving a statement using mathematical induction, specifically that for every integer n ≥ 0, 5 divides (9^n - 4^n). Participants are exploring the structure of the proof and the application of the induction hypothesis.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the base case and the inductive step, questioning how to formally express the divisibility of certain terms. There is a focus on the manipulation of expressions involving 9^k and 4^k and how they relate to the induction hypothesis.

Discussion Status

Some participants have offered guidance on how to approach the proof, particularly in relating the inductive step back to the induction hypothesis. There is an ongoing exploration of how to articulate the reasoning clearly, with multiple interpretations being considered.

Contextual Notes

Participants express uncertainty about the clarity of their expressions and the formal writing of their arguments. The discussion reflects a learning process where assumptions and definitions are being scrutinized.

flyingpig
Messages
2,574
Reaction score
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
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.
 
Mark44 said:
90 - 40 = 5
;;;
No.
 
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.
 
Even with 9k - 4k = 5M, I don't know what to do with

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

Can you show that this last expression is divisible by 5?
 
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?
 
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.
 
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?[/color]]

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.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
Replies
8
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
8
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K