Question: For each positive integer n , let P ( n ) be the inequality 2 n < ( n + 1)!. (a) Write P (2).
For each positive integern, letP(n)
be the inequality
2n< (n+ 1)!.
(a)
WriteP(2).
(b)
WriteP(k).
(c)
WriteP(k+ 1).
(d)
In a proof by mathematical induction that this inequality holds for every integern2,
what must be shown in the inductive step?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
