Proving <t**n> = n!τ**n using Mathematical Induction

In summary, the conversation discusses the definition of 'moments' in the distribution p(t) and the analytical proof that <t**n> = n!τ**n, using integration by parts and mathematical induction. The individual steps of the mathematical induction are not provided, but the person has solved the integral and is struggling with the next step.
  • #1
ZeroScope
18
0
The ’moments’ <t**n> of the distribution p(t) are defined as:

<t**n> = integral from (0, infinity) p(t).t**n dt (1) where ** denotes to the power of


Show (analytically) that

<t**n> = n!τ**n (2)

Hint: Use integration by parts to show that

<t**n> = nτ<t**n-1> (3)

and use mathematical induction



I have solved the integral to get equation 3 but i can't begin to think on where to start the mathematical induction. Its been so long since i have done it.

At first i thought that doing <tn>.<tn-1> = blabla would work but i get the answer

blabla = nτ<t**n-1> . (n-1)τ<t**n-2>

but i really think I am missing the mark by alot.

Sorry about the bad formatting.
 
Physics news on Phys.org
  • #2
ive solved it it's fine now
 

FAQ: Proving <t**n> = n!τ**n using Mathematical Induction

What is Mathematical Induction?

Mathematical induction is a method of mathematical proof used to prove statements about natural numbers or other mathematical structures that are defined recursively. It involves proving that a statement is true for the first natural number, and then showing that if it is true for any arbitrary natural number, it is also true for the next natural number.

How does Mathematical Induction work?

The basic steps of mathematical induction are as follows: 1. Prove that the statement is true for the first natural number (usually 1).2. Assume that the statement is true for some arbitrary natural number k.3. Use this assumption to prove that the statement is also true for the next natural number (k+1).4. Conclude that the statement is true for all natural numbers by the principle of mathematical induction.

What is the principle of mathematical induction?

The principle of mathematical induction states that if a statement is true for the first natural number and if it is true for any arbitrary natural number k, then it is also true for the next natural number (k+1). This allows us to extend the validity of a statement from a specific case to all natural numbers.

What types of statements can be proven using Mathematical Induction?

Mathematical induction is typically used to prove statements about natural numbers, such as formulas, equations, and inequalities. However, it can also be used to prove statements about other mathematical structures that are defined recursively, such as trees or graphs.

What is the difference between strong and weak induction?

Strong induction is a variation of mathematical induction where instead of assuming that a statement is true for an arbitrary natural number k, we assume that it is true for all natural numbers from 1 to k. This allows us to make stronger conclusions about the validity of a statement. Weak induction, on the other hand, only assumes that the statement is true for a specific natural number k and the next natural number (k+1).

Similar threads

Back
Top