SOLUTION: Please help me solve this induction question using a direct proof: Prove by induction that n!

SOLUTION: Please help me solve this induction question using a direct proof: Prove by induction that n! < n^n, for positive integers n >= 2

Question 872853: Please help me solve this induction question using a direct proof:
Prove by induction that n! < n^n, for positive integers n >= 2
Answer by jim_thompson5910(35256) (Show Source): You can put this solution on YOUR website!
First prove the base case n = 2.

n! < n^n
2! < 2^2
2 < 4 ... true

Inductive Step:

Assume the n = k case is true. So assume

k! < k^k

is true. We must prove the n = k+1 case is true based on the assumption n = k.

So start with k! < k^k and multiply both sides by k+1

k! < k^k
(k+1)*k! < (k+1)*k^k

The inequality is still true because k+1 is positive (n >= 2, so k > 2). So the inequality sign has NOT flipped. It only flips when we multiply both sides by a negative number.

Now if we replace the base 'k', of k^k on the right side, with 'k+1', we get

(k+1)*k! < (k+1)*k^k
(k+1)*k! < (k+1)*(k+1)^k
(k+1)*k! < (k+1)^1*(k+1)^k
(k+1)*k! < (k+1)^(1+k)
(k+1)*k! < (k+1)^(k+1)
(k+1)! < (k+1)^(k+1)

This last inequality is certainly true because (k+1)*k! < (k+1)*k^k is true and (k+1)^k is larger than k^k.
That means (k+1)*(k+1)^k is larger than (k+1)*k^k.
By extension, this means (k+1)*(k+1)^k is larger than (k+1)*k!
So the right side is still larger than the left side. That's all we care about.

So to wrap things up we assumed the equation held true for the n = k case. Then we just showed that the n = k+1 case is true based on the assumption that the inequality holds true when n = k.

This inductive step proves n! < n^n is true for all integers n >= 2.

RELATED QUESTIONS
Hello please help me solve this mathematical induction question, using "replacement... (answered by ikleyn)

How do u prove this?...Show that 3 divides n^3-n for all positive integers n. And does 4... (answered by khwang)

Prove by induction that 3^n ≥ 2n +1 for all positive... (answered by josgarithmetic)

Please help me with this mathematical induction question: Suppose we want to use... (answered by ikleyn)

Show that x - y is a factor of x^n - y^n for all positive integers n, using mathematical... (answered by math_helper,robertb)

How can I prove that for each positive integer n, the sum of the first n odd positive... (answered by tommyt3rd)

Prove that 5^{3^n} + 1 is divisible by 3^{n + 1} for all nonnegative integers n. Prove... (answered by CPhill)

Prove by mathematical induction that: 2^2n - 1 is divisible by 3 for all positive... (answered by Edwin McCravy)

Prove by mathematical induction that 8𝑛 − 3𝑛 is divisible by 5 for all positive... (answered by math_tutor2020,ikleyn)