Hey Nizbel99.

I don't know about the whole Lattice point thingy, so I can't help you there with regards to that.

My own conclusion is that the best way to do this is by induction since it's really setup for that kind of thing. Prove the first case then and do the rest of induction.

The first case is you let n = 1 show its true then show its true for n = k + 1 assuming true for n = k and then if that's done correctly true for all integers n >= 1.