Strong Induction

This is a video for students of CSCI 2824. It covers strong induction, another essential form of argument in computer science.

[MRBthecharger]

Yea, someone else already mentioned it but indeed, 1 is not a prime number hence why this problem typically starts at n >= 2. It was explained to me that if you took 1 to be prime, then you break the universe (at least the universe in which the fundamental theorem of arithmetic exist).

[qwe]

One thing I want to correct is:1 is not prime number.