I'm to prove that for n>=4, 2^n < n! holds, but I don't know where to go after the inductive hypothesis that it holds for n>= 4 after showing it works for the base case (n = 4). Here are my steps so far:(adsbygoogle = window.adsbygoogle || []).push({});

2^(n+1) < (n+1)!

2*(2^n) < (n+1)(n!)

but I dont' know where to now! help is much appreciated, thanks.

Josh

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Proof by Induction: 2^n < n!

Loading...

Similar Threads for Proof Induction | Date |
---|---|

I Can you use proof by contradiction in the midst of induction | Mar 21, 2016 |

Simple Proof for using Induction | Oct 8, 2014 |

Cantor set ℵ , inductive proofs by openly counting. | Nov 8, 2013 |

What's the point of inductive proofs? | Nov 2, 2013 |

Base Case in Strong Induction Proofs | Mar 30, 2013 |

**Physics Forums - The Fusion of Science and Community**