Building Blocks
for
Theoretical Computer Science


Margaret M. Fleck and the CS 173 course staff


Inequality Induction Study Problems


Problem 1

Prove the following claim by strong induction:

Claim: For all positive integers \(n \geq 2\), \(2^n n! < (2n)!\)

Need some help?

When you have a proof that seems close to correct, look at the solution.