> They just provided a formal argument for it which proves it by induction, as we call it. This is contradiction, I think. Assume n (exists and) is the larges

> They just provided a formal argument for it which proves it by induction, as we call it. This is contradiction, I think. Assume n (exists and) is the largest number representable in 64 bits is statement 1. The numbers in the n+x system are larger than n is statement 2. That causes a contradiction and since statement 2 is true, statement 1 must be false. The addition in n+x is not induction, just a way to define a system.