Prove Induction: (1+x^2)^n >(or equal to) (1+x^n)^2

In summary, the conversation discusses a proof by induction problem involving real numbers and natural numbers. The problem is broken down and the attempt at a solution is presented. The use of binomial coefficients and the relationship between x^n and x^(n+1) is explored. Eventually, the conversation concludes with a solution using the transitive property to show that the original inequality is true.
  • #1
hartigan83
19
0
Induction proof please help!

Homework Statement



Let x be any real number in the interval (0,1). Prove that for any natural number n greater or equal to 2 it is true that
(1+x^2)^n is greater or equal to (1+x^n)^2
(^ means exponent)

Homework Equations



:confused:

The Attempt at a Solution



Ok well I have been attempting to do this problem for a couple days and it has come to a point when I am not getting any further.:grumpy:

Here is what I have so far:
I believe that I should be doing a proof by Induction.

Proof:
Let n be a natural number greater than or equal to 2. Let 0 < x <1 and let p(n): (1+x^2) >(or equal to) (1+x^n)^2

Base case: WWTS p(2) is true.
p(2): (1+x^2)^2 >(or equal to) (1+x^2)^2. As (1+x^2)^2 = (1+x^2)^2, p(2) is true.

Inductive step: Assume p(n): (1+x^2)^n >(or equal to) (1+x^n)^2 is true. WWTS p(n+1): (1+x^2)^(n+1) >(or equal to) (1+x^(n+1))^2 is true.

I guess this is basically where I get stuck. I know that I have to use my assumption p(n) to try to get to p(n+1). I have tried adding different things to each side, multiplying each side by different things but nothing seems to give me what I want.
I recognize that to get the left sides of the equations to be the same I need to multiply (1+x^2)^n by (1+x^2). And in order to get the right sides to look the same I need to first multiply each out to get rid of the ^2 (just so it is easier to see what is needed)...
But I am seriously stuck. Any help would be greatly appreciated.
Thanks
 
Physics news on Phys.org
  • #2
Hi, I did not check your work carefully. It is possible that it is a dead end, maybe not. In any case, have you tried casting the problem in terms of binomial series?

With use of the famous identity on the binomial coefficients, this problem should be easy to tame:http://en.wikipedia.org/wiki/Pascal's_rule
 
  • #3
I should work using binomial coefficients.

But I first would examine the relationship between
[tex] x^n [/tex]
and
[tex] x^{n+1} [/tex]

The fact that x belongs to (0,1) should matter somewhere... ;-) (it's easy to check with some examples that it doesn't work if that condition is not verified)
 
  • #4
xnick said:
I should work using binomial coefficients.
I am not sure how to use binomial coefficients can you please explain more?
xnick said:
But I first would examine the relationship between
[tex] x^n [/tex]
and
[tex] x^{n+1} [/tex]
I realize that x^n times X gives me x^(n+1)
and I have realized that inorder to get the left sides to look the same it is necessary to multiply (1+x^2)^n by (1+x^2) but when I do this, I know that I also have to multiply the right side by this. But,
(1+x^n)^2 * (1+x^2) =
(1 +2x^n+x^2n) * (1+x^2)=
(1 +x^2+2x^n+ 2x^n*x^2+ x^(2n+2))=
(1 + x^2 +2^n*x^(n+2)+ x^(2n+2))

But I am trying to get (1+x^(n+1))^2
which is
(1+x^(n+1))(1+x^(n+1))=
(1+2x^(n+1)+(x^(n+1))^2) =
(1+2^(n+1)*x^(n+1) +x^(2n+2)

and these are not the same..I don't think...
What am I doing wrong?
 
  • #5
hartigan83 said:
and these are not the same..I don't think...
What am I doing wrong?
Your equations are fine, but you have to prove an inequality. Have you noticed
[tex] x^n > x^{n+1} [/tex] ?
(this doesn't hold if you let x have any value :wink:)
If it works using that, it may be easier than using binomial coeff. There is a link above pointing to an explanation of the subject... in short words, they are used for writing the general expansion of
[tex](a+b)^n[/tex]
for any n (also called Newton's binomy IIRC)

-------------------------------------------
BTW:My natural language is Spanish. I suspect that I'm doing some grammar incorrectly, so please forgive me and ignore the misspelling. o:)
 
  • #6
Ok here is what I have come up with. please tell me if there is a flaw in my reasoning.

I have
(1+x^2)^n *(1+x^2) {call this equation A} >/= (greater than or eqaul to) (1+2(x^n)+x^(2n)+x^2+2(x^n)*x^2) {call this equation B}
I want (1+x^2)^n *(1+x^2) {A} >/= (1 + 2(x^n+1) + x^(2n+2){call this C}
I am thinking of the transitive property if A >/= B and B >/= C then A >/= C

Now, comparing equations B and C we can cancel like terms ending up with
2(x^n)+x^(2n)+x^2+2(x^(n+2)) for B and
2(x^(n+1)) for C.

Now since x^n > x^(n+1), 2(x^n) > 2(x^(n+1))
Therefore, B > C
Using the transitive property A >/= C

Am I right?!? Please say yes o:)
 
  • #7
hartigan83 said:
Am I right?!? Please say yes o:)

I looks good to me!
 

1. What is "Prove Induction" and what does it mean to prove something?

Prove Induction is a mathematical method used to prove a statement is true for all natural numbers. To prove something means to provide evidence or logical reasoning to show that a statement is true.

2. What is the statement being proven in "Prove Induction: (1+x^2)^n >(or equal to) (1+x^n)^2"?

The statement being proven is that for all natural numbers n, the expression (1+x^2)^n is greater than or equal to (1+x^n)^2.

3. How does one use induction to prove a statement?

To use induction to prove a statement, one must first show that the statement is true for a base case (usually n=1). Then, assuming the statement is true for some natural number k, it must be shown that the statement is also true for k+1. This process is repeated until the statement is shown to be true for all natural numbers.

4. Why is induction a valid method for proving statements?

Induction is a valid method for proving statements because it is based on the fundamental principle of mathematical induction, which states that if a statement is true for a base case and if it is also true for n=k, then it must be true for n=k+1. This allows for the statement to be extended to all natural numbers.

5. Can induction be used to prove statements for all types of numbers, or only natural numbers?

Induction can only be used to prove statements for natural numbers. This is because the fundamental principle of mathematical induction only applies to natural numbers and cannot be extended to other types of numbers.

Similar threads

  • Calculus and Beyond Homework Help
Replies
7
Views
394
  • Calculus and Beyond Homework Help
Replies
22
Views
295
  • Calculus and Beyond Homework Help
Replies
15
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
919
  • Calculus and Beyond Homework Help
Replies
6
Views
1K
  • Calculus and Beyond Homework Help
Replies
20
Views
1K
  • Calculus and Beyond Homework Help
Replies
24
Views
768
  • Calculus and Beyond Homework Help
Replies
1
Views
492
  • Calculus and Beyond Homework Help
Replies
2
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
496
Back
Top