2. Let P(n) be the claim that n! > 2n for all
integers n4.
P(4) is the statement: 4! > 24.
P(k) is the statement: k! > 2k.
P(k+1) is the statement: (k + 1)! > 2k+1.
For a proof by induction, you first need to check that the statement P(4) is true. Then assume that P(k) is true and use this to show that P(k + 1) is true.