Proof by Induction: 1/1*2 + 1/2*3 + 1/3*4 +...+ 1/n(n+1) = n/n+1

In summary, the conversation is about trying to prove the equation 1/1*2 + 1/2*3 + 1/3*4 +...+ 1/n(n+1) = n/n+1 using mathematical induction. The steps for proving the equation are stated, but there is confusion on how to get the right side of the equation. The expert summarizer suggests substituting k+1 for all k's on the right side, but the person asking the question is still unsure.
  • #1
mweaver68
4
0
trying to prove the following

1/1*2 + 1/2*3 + 1/3*4 +...+ 1/n(n+1) = n/n+1

Prove P(1) true: 1/1*2 = 1/1+1 = 1/2

Assume P(k) true: 1/2 + 1/6 + 1/12 + ... + 1/k(k+1) = k/(k+1)

trying to prove P(k+1) true:

step 1: 1/2 + 1/6 + 1/12 + ... + 1/k(k+1) + 1/(k+1)[(K+1)+1] = k+1/[(k+1) + 1]
step 2: k / (k+1) + 1/(k+1)[(K+1)+1] = k+1/[(k+1) + 1]

I keep ending up with k+1 / (k+2) ^2 on the left hand side.

I have not been able to figure out what I am doing wrong here.

Any ideas.

Thanks.
 
Physics news on Phys.org
  • #2
mweaver68 said:
trying to prove the following

1/1*2 + 1/2*3 + 1/3*4 +...+ 1/n(n+1) = n/n+1

Prove P(1) true: 1/1*2 = 1/1+1 = 1/2

Assume P(k) true: 1/2 + 1/6 + 1/12 + ... + 1/k(k+1) = k/(k+1)

trying to prove P(k+1) true:

step 1: 1/2 + 1/6 + 1/12 + ... + 1/k(k+1) + 1/(k+1)[(K+1)+1] = k+1/[(k+1) + 1]
You don't know this yet, this is what you are trying to prove. You know that
1/2+ 1/6+ 1/12+ ...+ 1/[k(k+1)]+ 1/[(k+1)((k+1)+1)]= k/(k+1)+ 1/[(k+1)(k+2).
Now the right hand side WILL have k2+ 2k+ 1= (k+1)2 in the numerator, but that's easily taken care of!

step 2: k / (k+1) + 1/(k+1)[(K+1)+1] = k+1/[(k+1) + 1]

I keep ending up with k+1 / (k+2) ^2 on the left hand side.

I have not been able to figure out what I am doing wrong here.

Any ideas.

Thanks.
 
  • #3
Thanks for the reply.

You stated "1/2+ 1/6+ 1/12+ ...+ 1/[k(k+1)]+ 1/[(k+1)((k+1)+1)]= k/(k+1)+ 1/[(k+1)(k+2)." but I am not sure how you got the right side of this. I thought when trying to prove P(k+1), you substitute k+1 for all k's on the right side. so why isn't it (k+1) / [(k+1) + 1]?
 

FAQ: Proof by Induction: 1/1*2 + 1/2*3 + 1/3*4 +...+ 1/n(n+1) = n/n+1

What is proof by induction?

Proof by induction is a mathematical technique used to prove that a statement is true for all natural numbers. It involves showing that the statement is true for the first natural number, and then assuming it is true for some arbitrary natural number, and using that assumption to prove that it is also true for the next natural number. This process is repeated until it is shown to be true for all natural numbers.

How does proof by induction work?

Proof by induction works by breaking a statement down into smaller, simpler parts and then using those parts to prove the statement for larger numbers. The base case, where the statement is shown to be true for the first natural number, serves as the starting point. The inductive step, where the assumption is made and used to prove the statement for the next natural number, is what allows us to extend the proof to all natural numbers.

What is the statement being proven in this particular proof by induction?

In this proof by induction, we are proving the statement 1/1*2 + 1/2*3 + 1/3*4 +...+ 1/n(n+1) = n/n+1, which is a formula for the sum of a series of fractions. The statement is being proven to be true for all natural numbers n.

Why is this proof by induction important?

Proof by induction is important because it is a powerful and widely used method for proving mathematical statements. It allows us to prove that a statement is true for an infinite number of cases, without having to explicitly check each one. It also helps us to understand the structure and patterns of mathematical statements.

Can proof by induction be used for other types of statements besides mathematical formulas?

Yes, proof by induction can be used for other types of statements besides mathematical formulas. It can be used to prove statements about sequences, series, and even logical statements. However, it is most commonly used in mathematics due to its ability to prove statements for an infinite number of cases.

Back
Top