Proving rational surd inequalities

Click For Summary

Homework Help Overview

The discussion revolves around proving inequalities involving rational surds, specifically through the use of mathematical induction and algebraic manipulation. Participants are exploring various approaches to tackle the problem and clarify their understanding of the concepts involved.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation, Assumption checking

Approaches and Questions Raised

  • Participants discuss the potential awkwardness of using induction and suggest rearranging the original inequality instead. There are attempts to clarify the requirements of the problem and the validity of various approaches. Some participants question the sufficiency of initial steps in proving the inequality and explore the implications of contradictions.

Discussion Status

The discussion is active, with participants providing guidance on algebraic techniques and questioning the correctness of each other's approaches. There is an ongoing exploration of different methods, including the use of contradiction and algebraic manipulation, without a clear consensus on a single approach.

Contextual Notes

Some participants express confusion regarding the original problem statement and the specific parts that require induction. There are mentions of formatting issues with LaTeX, which may affect the clarity of the presented arguments.

chwala
Gold Member
Messages
2,835
Reaction score
426
Homework Statement
show that ##\frac {1}{2\sqrt {n+1} }##< ##(n+1)^{0.5} -n^{0.5}##
Relevant Equations
maths induction
1599899474619.png


my attempt, i am not good in this kind of questions ...i need guidance.
 
Physics news on Phys.org
I think using induction may be quite awkward in this case. Instead, why not rearrange the original inequality?
 
PeroK said:
I think using induction may be quite awkward in this case. Instead, why not rearrange the original inequality?

ok let me re arrange and upload...i have a problem with the latex for this problem...can you amend the original question for me?
 
1599900478273.png


sorry perok, this is how the original question looks like, a colleague suggested that i use maths induction...so what exactly am i supposed to do...thanks in advance
 
chwala said:
View attachment 269239

sorry perok, this is how the original question looks like, a colleague suggested that i use maths induction...so what exactly am i supposed to do...thanks in advance
That doesn't ask you to use induction for part a). Only part c).
 
ok let me type what i had done initially in a moment...hope you're safe during this trying times of corona virus...
 
1599902157388.png


is this right approach?
 
Showing that the inequality holds for ##n=0## is not sufficient to deduce it holds ##\forall n \geq 0##.
 
etotheipi said:
Showing that the inequality holds for ##n=0## is not sufficient to deduce it holds ##\forall n \geq 0##.

ok what approach should i take on this...see my proof above...is it correct?
 
  • #10
You can try raising both sides of the inequality to the power of ##-1##
 
  • #11
chwala said:
View attachment 269240

is this right approach?
I'm afraid I can't follow what you are trying to do here.

One approach is to assume that
$$\frac 1 {2\sqrt{n +1}} \ge \sqrt{n+1} - \sqrt n$$
And reach a contradiction, or a simple equation for ##n##. The first step must be to multiply through by ##\sqrt{n+1}##.
 
Last edited:
  • #12
ok let me try and follow what you have indicated...
 
  • #13
1599903656037.png
 
  • #14
The last two steps are simply not correct.

There are basic techniques here that you don't seem to have picked up. If you have a surd in the denominator, you try multiplying though by it; if you have one surd, you isolate it on one side of the equation; then you square the equation.

This is basic algebra.
 
  • Like
Likes   Reactions: chwala
  • #15
1599905285838.png
 
  • #16
that is my another approach...
 
  • #17
chwala said:
that is my another approach...
You're nearly there. Just one step to go.
 
  • Like
Likes   Reactions: chwala
  • #18
PeroK said:
You're nearly there. Just one step to go.
bingo...
 
  • #19
chwala said:
bingo...
But, look, you can cut out a lot of that unnecessary algebra. I'll do it without using contradiction:
$$\frac 1 {2\sqrt{n +1}} < \sqrt{n+1} - \sqrt n$$ $$\Leftrightarrow \ \ \frac 1 2 < n + 1 - \sqrt{n(n+1)}$$ $$\Leftrightarrow \ \ \sqrt{n(n+1)} < n + \frac 1 2$$ $$\Leftrightarrow \ \ n^2 + n < n^2 + n + \frac 1 4$$ $$\Leftrightarrow \ 0 < \frac 1 4$$
Therefore, the stated inequality is true for all ##n \ge 0##.
 
  • #20
ok...how would it look like with contradiction, ...
can we say ##n^2+n+0.25≤n^2+ n## is a contradiction, therefore the converse is true?
 
  • #21
chwala said:
ok...how would it look like with contradiction, ...
can we say ##n^2+n+0.25≤n^2+ n## is a contradiction, therefore the converse is true?
Yes, you cancel the ##n^2 + n## and leave a contradiction. If you don't use contradiction, then you need to take care that you have a two-way implication in each line.
 
  • Like
Likes   Reactions: chwala
  • #22
PeroK said:
Yes, you cancel the ##n^2 + n## and leave a contradiction. If you don't use contradiction, then you need to take care that you have a two-way implication in each line.

perok thanks for your time on this, i will endeavour to be more visible on this forum, cheers bingo:cool:
 
  • #23
1599949984597.png


this is how my colleague handled part a of the question
 
  • #24
1599950065412.png


this is how he did part (c) of the question, i would appreciate alternative ways...
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
9
Views
2K
  • · Replies 18 ·
Replies
18
Views
6K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K