HeroicPandas
Heroic!
- Joined
- Mar 8, 2012
- Messages
- 1,547
- Gender
- Male
- HSC
- 2013
LMAO!
Longer version? There's a LONGER VERSION?uh I thought the last sentence had to be the longer version?
Can someone verify? =/uh i'm not a genius at mx1 but your working out looks fine...
"and thus if the result is true for n=k it follows that it is true for n=k+1"
"since hte statement is true for n=2, the it is true for n=3 and for n=4, and so on for all positive integer values of n."
I would've done what you did, apart from state that k>=1, therefore 21k - 4 >0, and since 4^k etc >0, LHS is > 0. You seemed to ignore the -4 part :/Question: View attachment 26810
MY Answer: View attachment 26811
I was wondering if you guys could check if there was anything 'wrong' with my format because during trials, apparently I set up my induction questions poorly and as a result I only got 2 out of a potential 4. =/
Yep i verify, i would do a long conclusion like thisCan someone verify? =/
What? If you mean the line before my "LHS > 21k" then no I haven't, because we have already proven that the things in the bracket are greater than 1 in the 'verify for n=2' segment.I would've done what you did, apart from state that k>=1, therefore 21k - 4 >0, and since 4^k etc >0, LHS is > 0. You seemed to ignore the -4 part :/
Did you? All I see is that you proved that it equals 1 when k=2, not that it is greater than one for all values of k (or n). Your assumption was that the things within the brackets were greater than zeroWhat? If you mean the line before my "LHS > 21k" then no I haven't, because we have already proven that the things in the bracket are greater than 1 in the 'verify for n=2' segment.
just wondering why is k>=1?Did you? All I see is that you proved that it equals 1 when k=2, not that it is greater than one for all values of k (or n). Your assumption was that the things within the brackets were greater than zero
Maybe I'm missing something, running on little sleep
Yes. Well, that's what I think anyway.just wondering why is k>=1?
is it because n=k+1 and n>=2?
Yeah, that's where I got it fromYes. Well, that's what I think anyway.
Not that this is the place to ask, but I'm pretty sure we do. Its not too difficult thoughdo we need to know simpson's rule and trapezoidal rule??
This@Shadow - you do NOT have to write that long conclusion for induction. In the words of my maths teacher, you do "not get marks for a memorised sentence".
It's a misconception that you NEED to write the statement. While there's nothing wrong with the statement, it's unnecessary.