Solving Integral Recursion: Proving I(n) for n∈ℕ0

In summary, the conversation discusses the integration of 1/(1+x^2)^n with n ∈ ℕ0 and the formula ∀ n ∈ ℕ0, n≠1 : I(n) = 1/(2(n-1)) * x/((1+x^2)^(n-1)) + (2n-3)/(2(n-1)) * I(n-1). The conversation also covers the steps to prove this formula and clarifies the meaning of ℕ0 to be all natural numbers except for 0.
  • #1
Alexx1
86
0
Can someone help me with this? I don't know how to begin

I(n) = integral 1/(1+x^2)^n dx with n ∈ ℕ0

Than: ∀ n ∈ ℕ0, n≠1 : I(n) = 1/(2(n-1)) * x/((1+x^2)^(n-1)) + (2n-3)/(2(n-1)) * I(n-1)

I have to prove this, but I don't know how to start
 
Mathematics news on Phys.org
  • #2
Learn latex for beggining

[tex]I_n=\int \frac{dx}{(1+x^2)^n}[/tex]

Try to do this integral for [tex]n=0,2,3...[/tex]
 
  • #3
Hint:
Write:
[tex]I_{n}=\int{1}*\frac{1}{(1+x^{2})^{n}}dx[/tex]
 
Last edited:
  • #4
arildno said:
Hint:
Write:
[tex]I_{n}=\int{1}*\frac{1}{(1+x^{2})^{n}}dx[/tex]

I know, than I can do:

u = 1/((1+x^2)^n) --> du = (-2nx)/((1+x^2)^(n+1))s
dv = 1 --> v = x

= x/((1+x^2)^n) + 2n integral x^2/((1+x^2)^(n+1))

But what now?
 
  • #5
Rewrite:
[tex]\frac{x^{2}}{(1+x^{2})^{n+1}}=\frac{x^{2}+1-1}{(1+x^{2})^{n+1}}=\frac{1}{(1+x^{2})^{n}}-\frac{1}{(1+x^{2})^{n+1}}[/tex]
See if that helps..:smile:
 
  • #6
arildno said:
Rewrite:
[tex]\frac{x^{2}}{(1+x^{2})^{n+1}}=\frac{x^{2}+1-1}{(1+x^{2})^{n+1}}=\frac{1}{(1+x^{2})^{n}}-\frac{1}{(1+x^{2})^{n+1}}[/tex]
See if that helps..:smile:

For the moment I have:

I(n) = x/((1-2n)((1+x^2)^n)) - (2n/(1-2n))*I(n+1)

What do I have to do next?
 
  • #7
Solve that equation for I(n+1) instead, and report back!
 
  • #8
arildno said:
Solve that equation for I(n+1) instead, and report back!

I(n+1) = x/((x^2+1)^(n+1)) + 2(n+1)*(I(n+1)-I(n+2))
 
  • #9
No!
Just rearrange, and get:

[tex]I_{n+1}=\frac{1}{2n}\frac{x}{(1+x^{2})^{n}}+\frac{2n-1}{2n}I_{n}[/tex]
Verify this, and then see if you manage the last step in the derivation on your own.
 
  • #10
arildno said:
No!
Just rearrange, and get:

[tex]I_{n+1}=\frac{1}{2n}\frac{x}{(1+x^{2})^{n}}+\frac{2n-1}{2n}I_{n}[/tex]
Verify this, and then see if you manage the last step in the derivation on your own.

Ok, now I see it, you have to change n into n-1 and than you get the result
Thank you very much!
 
  • #11
Alexx1 said:
Ok, now I see it, you have to change n into n-1 and than you get the result
Right!
Note that in our derivation n=0 is prohibited, and by the index change this entails prohibition on n=1 instead
Thank you very much!
My pleasure! :smile:
 
  • #12
arildno said:
Right!
Note that in our derivation n=0 is prohibited, and by the index change this entails prohibition on n=1 instead

My pleasure! :smile:

n ∈ ℕ0

with ℕ0 , I meant: 'all the natural numbers except for 0'
 
  • #13
Alexx1 said:
n ∈ ℕ0

with ℕ0 , I meant: 'all the natural numbers except for 0'
I know.

Note, however, that with just prior to dividing with 2n, we have the equation:

2nI(n+1)=x/(1+x^2)^{n}+(2n-1)I(n)

Note that setting n=0 here yields: 0=x-I(0), which is correct, up to an arbitrary constant C...
 

FAQ: Solving Integral Recursion: Proving I(n) for n∈ℕ0

What is integral recursion?

Integral recursion is a mathematical concept where a sequence is defined by a function that involves previous terms in the sequence. This means that the value of each term depends on the values of previous terms.

How do you solve integral recursion?

To solve integral recursion, you need to find a closed-form expression for the sequence, which means finding a function that directly calculates the value of any term without relying on previous terms. This can be done through various methods such as substitution, iteration, or using generating functions.

What is the importance of proving I(n) for n∈ℕ0 in integral recursion?

Proving I(n) for n∈ℕ0 is important because it ensures that the sequence is well-defined and that the function used to define it is valid for all values of n. It also allows us to find the exact solution for the sequence, which can be useful in various applications.

What are some common techniques used to prove I(n) for n∈ℕ0?

Some common techniques used to prove I(n) for n∈ℕ0 include mathematical induction, strong induction, and recursion trees. These techniques involve using logical arguments and mathematical reasoning to show that the function defining the sequence is valid for all values of n.

Are there any real-world applications of solving integral recursion?

Yes, there are several real-world applications of solving integral recursion. Some examples include analyzing the growth of a population over time, predicting stock prices, and modeling the spread of diseases. In these applications, integral recursion can be used to find the exact solution for the sequence and make accurate predictions or decisions.

Similar threads

Replies
4
Views
3K
Replies
14
Views
2K
Replies
19
Views
2K
Replies
1
Views
1K
Replies
12
Views
587
Back
Top