View Full Version : Mathematical Induction
supasupa
Jul28-06, 09:11 PM
Hey there evryone
I need some help with this problem as I dont know which direction to go with it.
Prove by mathematical induction that (13^n)-(6^n) is divisible by 7.
The Base Step is obviously ok....
Then assume (13^K)-(6^K) is true
Then have to prove (13^(k+1))-(6^(k+1)) is true...... how do i do this
thank heaps....
Office_Shredder
Jul28-06, 09:35 PM
Can you factor (13^(k+1))-(6^(k+1)) ?
supasupa
Jul28-06, 09:40 PM
yeah thats what i have been trying to do but i dont know how to get
(13^(k+1) - 6^(k+1))
as a multiple of (13^k - 6^k).
I dont know if this is the correct direction to take
StatusX
Jul28-06, 09:41 PM
13^{k+1}-6^{k+1}=13 \cdot (13^k-6^k)+7 \cdot 6^k
supasupa
Jul28-06, 09:42 PM
how do you do that?
like what is the step u take to get there
supasupa
Jul28-06, 09:44 PM
i get
13.13^K - 6.6^K
then what do i do??
Office_Shredder
Jul28-06, 09:45 PM
Instead of trying that..... can you find a way to just show (13^(k+1) - 6^(k+1)) is divisible by seven? What looks like it equal seven in that equation?
StatusX
Jul28-06, 10:03 PM
i get
13.13^K - 6.6^K
then what do i do??
=13.13^K-(13-7).6^K=13(13^K-6^K)+7.6^K
supasupa
Jul28-06, 10:04 PM
thank you very much.....that makes a heap more sense now
:smile:
Gokul43201
Jul28-06, 11:18 PM
In all this, you've missed out the slightly easier solution Shredder was trying to point you to. There is a standard factorization for a^n - b^n. You use a specific case of this factorization when you write the sum of a geometric series : 1+b+b^2+...+b^{n-1} = (1-b^n)/(1-b)
vBulletin® v3.8.7, Copyright ©2000-2012, vBulletin Solutions, Inc.