Prove n^2 > 2n for n>2 by induction

Check n = 3

9 > 6

Say it is true for n

now check for n+1

This is where I am worried that what I'm doing isn't enough proof

(n+1)^2 > 2(n+1)

n^2+2n+1 > 2n +2

by cancelling

n^2 > 1

we know that n > 2 so n^2 is always going to be greater than 1.

Does this suffice?