Calling it reverse induction, anyone ever used this?
With induction you prove base case P0 and Pn->P(n+1) so Pn is true for all n, my method goes as follows:
Want to prove P0, so prove that Pn<-P(n+1) for all n. Then you get a chain saying P0 is true if P1 is true if P2 is true etc. Then the problem just solves itself easily in the lim n->infinity case cuz that one's easy.
With induction you prove base case P0 and Pn->P(n+1) so Pn is true for all n, my method goes as follows:
Want to prove P0, so prove that Pn<-P(n+1) for all n. Then you get a chain saying P0 is true if P1 is true if P2 is true etc. Then the problem just solves itself easily in the lim n->infinity case cuz that one's easy.
