Thread: Inequalities

Can anyone help me confirm if I have solved this correctly?

Many thanks.

Q. (1 + ax)ⁿ > 1 + anx, for a > 0, x > 0 & n

Attempt: Step 1: For n = 1...
(1 + ax)¹ = 1 + ax & 1 + a(1)x = 1 + ax
Since 1 + ax > 1 + ax, n is true.

Step 2: Assume the statement is true for n = k, i.e. assume (1 + ax)^k > 1 + akx.
We must now show that the statement is true for n = k + 1,
i.e. (1 + ax)^k+1 > 1 + a(k + 1)x = 1 + akx + ax
(1 + ax)^k+1 = (1 + ax)(1 + ax)^k > (1 + ax)(1 + akx)...((1 + ax)^k > 1 + akx...assumed)
If (1 + ax)(1 + akx) > 1 + akx + ax, then (1 + ax)^k+1 > 1 + akx + ax
(1 + ax)(1 + akx) > 1 + akx + ax
if (1 + ax)(1 + akx) - (1 + akx + ax) > 0
if akx² + akx + ax + 1 - 1 - akx - ax > 0
if akx² > 0
if x²[ak] > 0...true when a & x > 0 & n > 1
(1 + ax)^k+1 > 1 + akx + ax
Therefore, the statement is true for n = k + 1, if true for n = k. Thus, the statement is true for all a, x & n > 1, n .

Originally Posted by GrigOrig99

Can anyone help me confirm if I have solved this correctly?

Many thanks.

Q. (1 + ax)ⁿ > 1 + anx, for a > 0, x > 0 & n

Attempt: Step 1: For n = 1...
(1 + ax)¹ = 1 + ax & 1 + a(1)x = 1 + ax
Since 1 + ax > 1 + ax, n is true.

Step 2: Assume the statement is true for n = k, i.e. assume (1 + ax)^k > 1 + akx.
We must now show that the statement is true for n = k + 1,
i.e. (1 + ax)^k+1 > 1 + a(k + 1)x = 1 + akx + ax
(1 + ax)^k+1 = (1 + ax)(1 + ax)^k > (1 + ax)(1 + akx)...((1 + ax)^k > 1 + akx...assumed)
If (1 + ax)(1 + akx) > 1 + akx + ax,

Why the "if" here?

then (1 + ax)^k+1 > 1 + akx + ax
(1 + ax)(1 + akx) > 1 + akx + ax
if (1 + ax)(1 + akx) - (1 + akx + ax) > 0
if akx² + akx + ax + 1 - 1 - akx - ax > 0
if akx² > 0
if x²[ak] > 0...true when a & x > 0 & n > 1
(1 + ax)^k+1 > 1 + akx + ax
Therefore, the statement is true for n = k + 1, if true for n = k. Thus, the statement is true for all a, x & n > 1, n .

You have a whole series of "if"s here. Do you actually show any of those are true?

The simplest way to do this is to actually mutiply . What do you get when you do that?

Originally Posted by GrigOrig99

Can anyone help me confirm if I have solved this correctly?
Q. (1 + ax)ⁿ > 1 + anx, for a > 0, x > 0 & n
Attempt: Step 1: For n = 1...
Since 1 + ax > 1 + ax, n is true.

Step 2: Assume the statement is true for n = k, i.e. assume (1 + ax)^k > 1 + akx.
We must now show that the statement is true for n = k + 1,

This is also known as Bernoull's inequality.

You tend to over-do it and it is hard to read.

I've mentioned this before, but I guess it bears repeating. The format I'm using to answer these questions is coming from the text book itself; an example of which I will provide in an attachment.

Also, in the previous Inequalities question I posted, (1 +2x)(1 + 2kx) was solved by user 'Prove It' as follows:
= 1 + 2kx + 2x + 2kx²

Comparing his solution with that of (1 + ax)(1 + akx), shouldn't it be solved as:
1 + akx + ax + akx², rather than 1 + akx + ax + a²kx...?