This is how induction proof work. You prove that something is true for a base (n = 1) case then you prove that if it is true for n it has to be true for n + 1. Therefore it is true for any n.
The flaw is that the second part of the proof requires n >= 2
The flaw is that the second part of the proof requires n >= 2