Mathematical Induction with an Inequality

Click For Summary

Homework Help Overview

The discussion revolves around proving the inequality (n + 1)n - 1 < nn for n ∈ Z+, with a focus on using mathematical induction as a suggested method. Participants are exploring the nuances of applying induction to inequalities.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • The original poster attempts to follow a hint regarding the induction hypothesis but expresses uncertainty about their approach. Some participants question the necessity of establishing a base case for the induction proof, while others suggest clarifying the induction step involving the transition from n = k to n = k + 1.

Discussion Status

Participants are actively discussing the requirements for a valid induction proof, including the base case and the correct formulation of the induction step. There is an acknowledgment of the need for further exploration of the inequality's components, but no consensus has been reached on a definitive approach.

Contextual Notes

Some participants note issues with the clarity of the original post's presentation, suggesting that inequalities should be written directly in the text rather than as images. There is also a mention of the original poster's comfort level with induction, indicating a potential gap in understanding when applied to inequalities.

yellowsnow
Messages
4
Reaction score
0

Homework Statement



Prove that (n + 1)n - 1 < nn for n ∈ Z+. [Hint: Induction is suggested. Write out the induction statement explicitly. Make one side of the inequality look like your induction hypothesis.]

Homework Equations



The Attempt at a Solution



PS2-1.png


^ That's what I have so far. I'm good with induction, for the most part, but not really for inequalities.

I tried to follow the hint, but I'm not sure if I did that right.

If anyone can help me out I'd really appreciate it.

Thanks!
 
Last edited:
Physics news on Phys.org
Your image is way too big (1996 pixels X 1869 pixels). Please shrink your image to about 800 x 600. Better yet, write your inequalities right in the text entry window.
 
Mark44 said:
Your image is way too big (1996 pixels X 1869 pixels). Please shrink your image to about 800 x 600. Better yet, write your inequalities right in the text entry window.
Yeah, I resized it soon after posting (shows 613 x 573 now)

I'll try typing it up though :)
 
You don't include it, but you also need to show that the statement is true in a base case, such as when n = 1. This is easy to show, since 20 <= 11.

You have for the case n = k + 1, (k + 2)k <= (k + 1)k + 1. You seem to be assuming that this is true. Instead you need to show that it is true, using the statement in the induction hypothesis (i.e., (k + 1)k - 1 <= kk).

I don't have any other advice or tips right now, but I'll give it some thought.
 
I haven't taken this all the way through, so can't guarantee this is the way to go.

You need to show that (k + 2)k <= (k + 1)k + 1

Working with the left side, we have
(k + 2)k = (k + 2)(k + 2)k - 1 = (k + 2) ( (k + 1) + 1)k -1

Now expand the last factor using the Binomial Theorem, which says that
(a + b)^n = {{n}\choose{0}}a^nb^0 + {{n}\choose{1}}a^{n - 1}b^1 + {{n}\choose{2}}a^{n - 2}b^2 + ... + {{n}\choose{n}}a^{0}b^n
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
5
Views
2K
  • · Replies 12 ·
Replies
12
Views
8K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
6K