Hi,
Is the following a suitable method for induction? (For the purpose of brevity, I'm going to skip the testing and the conclusion)
Thanks
I guess so, but it's probably safer to use the algebraic method.Ok, though if I just used the graphical method would it still be ok (For the HSC)?
no, because the gradient of x^2 is larger than the gradient of 500+x, but x^2 isn't always largerIf the question doesn't explicitly ask for MI (e.g prove than 2^n>/= n^2 (n>/=4)(idk how to use LaTeX and ceebs learning)) can you just draw a graph of the two functions and say that due to the gradient of n^2 always being less than 2^n, 2^n will always be larger?
probably, but i envision it'd be more difficultJust about the OP's question, is there a way to do that by showing 2^n - n^2 >= 0 (minusing n^2)? Thanks!