- #1

- 2

- 0

## Main Question or Discussion Point

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

- 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

- 250

(try using the X

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

- Last Post

- Replies
- 2

- Views
- 2K

- Last Post

- Replies
- 11

- Views
- 796

- Last Post

- Replies
- 4

- Views
- 2K

- Last Post

- Replies
- 7

- Views
- 5K

- Last Post

- Replies
- 13

- Views
- 34K

- Replies
- 3

- Views
- 2K

- Replies
- 5

- Views
- 5K

- Replies
- 5

- Views
- 772

- Last Post

- Replies
- 8

- Views
- 14K

- Replies
- 1

- Views
- 2K