A Factorial Lower Bound

A Factorial Lower Bound

IB Year 5 | Grade 11
6 marks

Prove by mathematical induction that \(n!\ge2^{n-1}\) for every \(n\in\mathbb Z^+\).[6]

Solution:

Solution locked

680+ questions here come with free worked solutions. A free account saves your questions and progress; this one needs tuition enrolment.

Create a free account to practise similar questions.

Answer:\(n!\ge2^{n-1}\) for every \(n\in\mathbb Z^+\).

Need help? Join our JC Math tuition classes.

Learn more