Prove by induction 5^(n+1)+4x6^n when divided by 20 leaves the remainder 9 for all n element of N
\[5^{n+1}+4.6^{n} = 20 m + 9 \] \[5^{n+1+1}+4.6^{n+1} = 5.5^{n+1}+6.4.6^{n} = 5.5^{n+1}+ (5+1)4.6^{n} = 5.5^{n+1}+ 5.4.6^{n} +4.6^{n} \] \[ = 5[5^{n+1}+4.6^{n}] + 4.6^{n} = 5[20m+9] +4.6^{n} \]
can we thus say that p(n+1) also leaves a remainder 9 when divided by 20 ?? else pls show me how to present the answer !!
are those dots multiplication?
yes
\[\times\]
.\times
ok let me look at this for a sec
yes the dots indicate multiplication
hmm, I dont see how this would imply that it leaves a 9 as a remainder.
you never actually use the inductive hypothesis, I see that you plugged it in, but notice that it actually does nothing, as what you replaced it with would still be an integer.
i want to know how to prove the statement by induction..i was just trying it ... i know i was not correct .. in case you can help with this ?
im trying to figure it out as well. I took the same steps as you and arrived at the same point.
ok got it
5*4*6^n+4*6^n+5*5^(n+1)
so 20*6^n+4*6^n + 5*5^(n+1)
20*6^n+20m+9 = 20(6^n+m)+9
understand?
how did you replace 4*6^n + 5*5^(n+1) = 20m+9 as 5^(n+1)+4x6^n = 20m+9 ???
you have \[5*5^{n+1}+6*4*6^n \]this is in your second line so \[5*5^{n+1}+6*4*6^n = 5*5^{n+1}+5*4*6^n+4*6^n = 20*6^n+(5*5^{n+1}+4*6^n)\\\text{by IH} = 20*6^n+20m+9 = 20(6^n+m)+9\]
that is what i am trying to point out 5∗5^(n+1)+4∗6^n means 5^(n+2) + 4*6^n which is not equal to 20m+9
oh I wrote something down wrong, sorry
By IH, \(5^{n+1}+4.6^{n} = 20 m + 9\) not \(\color{red}{5} * 5^{n+1}+4.6^{n} = 20 m + 9\) ?
yes correct !!
well im guessing ganesh has it:) so im back to my movie
ohk.. lets start over ive something but to prove n+1, but it uses congruences... can we use them ?
which movi u watching zz ? :)
about to start Synecdoche, New York (2008)
it is a problem given in a class 11 book, where congruences have not been discussed
oh then let me think, however just to prove that this is actually true :- \(5[5^{n+1}+4.6^{n}] + 4.6^{n} \equiv 5*9 + 4.6^n \equiv 5 + 4*6^n \equiv 9\mod 20\) \(5 + 4*6^n \equiv 9\mod 20 \) \( 4*6^n \equiv 4\mod 20 \) \( 6^n \equiv 1\mod 5 \) By FLT its true. QED So we're pursuing a legitimate proof, but this is not acceptable at 11th grade. let me think a bit...
for 11th grade, id slightly change the above arguemnt by hiding congruences : \(5[5^{n+1}+4.6^{n}] + 4.6^{n} \) \(5[20m+9] + 4.6^{n} \) \(5[20m+9] + 4(5k+1)\) ***** \(5*20m+ 45 + 20k+4\) \(20(5m +k+ 2)+9\)
how did you get 4.6^n = 4(5k+1) ?
***** we can prove it easily a sub induction proof for showing : \(6^n = 5k+1\) or in words, \(6^n\) leaves a remainder of 1, when divided by 5
you want me prove... or you wana give it a try. im not sure if there is any we can avoid dealing wid this
ok i got it .. thanks
good :) proving that 6^n-1 is divisible 5 is easy, give it a try...
sure :)
Join our real-time social learning platform and learn together with your friends!