Prove the following using the principle of mathematic induction.

n! > n^2, for all integers n >= 4.

I am especially having trouble with the inductive step. Thanks for your help.

Printable View

- Oct 29th 2012, 07:01 PMWalshyHelp with a proof by induction
Prove the following using the principle of mathematic induction.

n! > n^2, for all integers n >= 4.

I am especially having trouble with the inductive step. Thanks for your help. - Oct 29th 2012, 07:06 PMProve ItRe: Help with a proof by induction
- Oct 29th 2012, 07:09 PMWalshyRe: Help with a proof by induction
Basis Step: 4!>4^2, 24>16 - that works.

Inductive step: Assume k! >k^2

Goal: (k+1)! > (k+1)^2

= k+1(k!) > k^2+2k+1

stuck here. - Oct 29th 2012, 07:15 PMProve ItRe: Help with a proof by induction