Induction proof of an inequality

Click For Summary

Homework Help Overview

The discussion revolves around proving the inequality n! ≤ n^n for all integers n ≥ 1 using mathematical induction.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to establish a base case and an inductive hypothesis but expresses confusion about progressing to the inductive step. Participants suggest rewriting the inequality in terms of k and k^k to clarify the relationship.

Discussion Status

The discussion is ongoing, with participants exploring different interpretations of the inductive step. Some guidance has been offered regarding the formulation of the right-hand side of the inequality, indicating a productive direction in the conversation.

Contextual Notes

Participants are navigating the complexities of the inductive proof and questioning the correctness of their expressions, which may indicate a need for clearer definitions or assumptions in the problem setup.

nastygoalie89
Messages
17
Reaction score
0

Homework Statement



for all integers n>=1, n! <= n^n

Homework Equations





The Attempt at a Solution



Base case: (1)! <= (1)^(1) 1=1 check
Inductive hypothesis: suppose k!<=k^k
P(k+1): (k+1)! <= (k+1)^(k+1)

From here on out I get very confused. Any help would be appreciated!
 
Physics news on Phys.org
Write (k+1)! \le (k+1)^{k+1} in terms of k and k^k.
 
so it would be k!(k+1) <= (k+1)^k + (k+1) ?
 
The right hand side is incorrect, but you're on the right track.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 11 ·
Replies
11
Views
4K
Replies
6
Views
3K
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K