- #1

- 2

- 0

prove by Induction that n! ≥ 2^(n-1) n ≥ 1

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter kudzie adore
- Start date

- #1

- 2

- 0

prove by Induction that n! ≥ 2^(n-1) n ≥ 1

- #2

pwsnafu

Science Advisor

- 1,080

- 85

Okay, so show us what you have attempted.

- #3

- 2

- 0

for n=k k!≥ 2^ (k-1) and I assumed that n=k to be true

then for n= k+1 its (k+1)! ≥ 2^[(k+1)-1]

proof for n=(k+1)

(k!)(k+1) ≥ _____?

the problem is that how do we reach the proof for (k+1)

- #4

tiny-tim

Science Advisor

Homework Helper

- 25,832

- 251

(try using the X

hint: if an equation is true, then multiplying both sides by the same factor will still be true

Share: