How can I prove by induction that: for all n>=4 I do: n=k P(k) = k^2 > 3k P(k+1) = (k+1)^2 > 3(k+1) How to solve P(k) --> P(k+1) to prove that P(n) is truth ???
Follow Math Help Forum on Facebook and Google+
Also, writing is syntactically wrong -- is a proposition, not a number.
Why ??
Use the induction hypothesis -
OK. But I not understand why K^2 > 3k (k+1)^2 > 3(k+1) ---Why you used 3k+2k+1 ???
I not understand why 3k+2k+1 if 3(k+1) = 3k+3 not 3k+2k+1
It's an intermediate step.. Do you understand why ? If yes, then my argument is .
I know that k^2+2k+1 > 3k+2k+1 From where did 3k+2k+1 ?
Why does it matter? I don't really understand what's your difficulty. Can you tell me what part you don't understand of my last line in the last post?
What you did was take an any expression to prove that (k+1)^2 > 3k + 3 ? For example Prove that is divisible by 3 I do: 4m + 1 is divisible by 3 then also divisible by 3 Correct ?
Originally Posted by Apprentice123 What you did was take an any expression to prove that (k+1)^2 > 3k + 3 ? I don't understand your question. Can you rephrase? For example Prove that is divisible by 3 I do: 4m + 1 is divisible by 3 then also divisible by 3 Correct ? That is correct, but you might want to say where you're using the induction hypothesis.
OK. Thank you
View Tag Cloud