Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (swissgirl):

Prove by mathematical Inducttion: \( 10^{(n+1)} + 3.4^{(n-1)} +5 \) is divisible by 9

Parth (parthkohli):

10^{(n + 1)} That'd work :)

OpenStudy (swissgirl):

okkkk thanks u r awesosme parth

Parth (parthkohli):

Let's start with 1. \( \color{Black}{\Rightarrow 10^{2} + 3.4^{0} + 5 }\) \( \color{Black}{\Rightarrow 100 + 1 + 5 }\) \( \color{Black}{\Rightarrow 106}\)

OpenStudy (swissgirl):

Ya its not divisible by 9 so i guesss its not true

Parth (parthkohli):

Never heard that 106 was divisible by 9.

OpenStudy (anonymous):

Pretty sure 106 is not divisible by nine.

OpenStudy (swissgirl):

The way the question is phrased seems like these statemnets must be true but who knows

Parth (parthkohli):

The question should have said - "Disprove by Mathematical Induction". Heh!

OpenStudy (anonymous):

curious, what book are you using for these induction problems?

OpenStudy (swissgirl):

It says use the PMI to prove the following for all natural numbers

Parth (parthkohli):

lol, 1 is also a natural number :P

OpenStudy (swissgirl):

A transition to advanced mathematics By douglas smith, Maurice eggen and Richard St andre

Parth (parthkohli):

'advanced mathematics' is an overstatement.

OpenStudy (anonymous):

maybe its \( 10^{n+1}+3 * 4^{n-1}+5 \) ????

OpenStudy (swissgirl):

YAAAAAAAAAAAAAAAAAAAA

OpenStudy (swissgirl):

I knew that the statement had to be true. ALRIGHTY THANKS

OpenStudy (swissgirl):

I am trying to solve it but i cant obviously

OpenStudy (swissgirl):

like how wld u prove its true for (n+1)?

OpenStudy (phi):

can you show it is true for n=0 (that is the first step, prove true for the "base case")

OpenStudy (swissgirl):

umm well its all natural numbers so it n=1 10^2+3*4^0 +5 = 108 and 9 divides 108

OpenStudy (phi):

ok, now assume it is true for all cases up to n is it true for n+1? replace n with n+1 in the equation, what do you get?

OpenStudy (swissgirl):

\( 10^ {(n+2)} + 3*4^n +5 \)

OpenStudy (swissgirl):

Like i am not sure how I am suppossed to show that this is divisible by 9

OpenStudy (phi):

right now I am waiting for an idea to show up.

OpenStudy (swissgirl):

hahahahahahahah

OpenStudy (experimentx):

10^n = 1 mod 9

OpenStudy (swissgirl):

I have learnt modulus but not in this course yet. like that is next chapter but i guess we can use ittttttttttt

OpenStudy (phi):

exp that is helpful this may not be the fastest way, but we could group like this 10*10^(n+1) + 4*3*4^(n-1) +5 6*10^(n+1) + 4*10^(n+1) + 4*3*4^(n-1)+ 4*5 -15

OpenStudy (phi):

that becomes 6*10^(n+1) +4( stuff div by 9) -15 now we must show 6*10^(n+1)-15 is div by 9

OpenStudy (experimentx):

well, the right thing to do is do assume it to be true up to n ... rigorously and prove it or n+1

OpenStudy (experimentx):

man ... i'm not comfortable with group theory

OpenStudy (swissgirl):

ohhhhh i found a similar method

OpenStudy (experimentx):

|dw:1343150166152:dw| so we have the same sequence

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!