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

Need help on a couple quick induction proofs

OpenStudy (anonymous):

OpenStudy (anonymous):

@ganeshie8

OpenStudy (algorithm):

I guess we need to use s(n) = x

OpenStudy (reemii):

1) Check for smallest possible \(n\). 2) Induction hypothesis: okay for \(n=k\) (for some \(k\)) 3) proof for \(n=k+1\). Did you check 1) ?

OpenStudy (anonymous):

I figured them out, sorry

OpenStudy (reemii):

nice

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!