i have to prove by induction that n(adsbygoogle = window.adsbygoogle || []).push({}); ^{2}< n! for n > 3

this is what i have done:

the base case (n = 4) is obviously true since 4^{2}< 4!

now, assume that it is true for n = k, i.e., k^{2}< k!

now i have to prove it for n = k+1

since k > 3,

1 < k-1

1(k+1) < (k-1)(k+1)

k+1 < k^{2}- 1 < k^{2}< k!

k+1 < k!

(k+1)(k+1) < (k+1)k!

(k+1)^{2}< (k+1)!

what i have done seems ok to me. but is there any simpler way to do the induction step? what i have done seems a bit "forced" (if you know what i mean).

thanks in advance.

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

Join Physics Forums Today!

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

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

# Proof by induction: help

Loading...

Similar Threads - Proof induction help | Date |
---|---|

I Can you make the induction step by contradiction? | Jun 19, 2016 |

Proof using mathematical induction | Sep 6, 2015 |

I'm missing something re: proof by induction | Jun 19, 2015 |

Induction proof | Mar 17, 2015 |

Need help with this induction proof | Jun 1, 2008 |

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