Proof by induction an expression

Finally, you might note that this is just half of the more familiar formula\sum_{i= 1}^n i= \frac{n(n+ 1)}{2}.In summary, the conversation is about proving by induction the expression \sum_{i=1}^{n-1}(n-i)=\frac
  • #1
xeon123
90
0
I'm trying to prove by induction the expression:

[itex]\sum_{i=1}^{n-1}(n-i)=\frac{n(n-1)}{2}[/itex]

For the base case, n=2, S(2)=[itex]\frac{2(2-1)}{2}=1[/itex]

For S(n+1)=[itex]\frac{(n+1)((n+1)-1)}{2}[/itex] I have:

S(n+1) = [itex]\frac{n(n-1)}{2}[/itex] + (n+1) <--- Is this correct?

I don't know what is the term for n+1. Any help?
 
Last edited:
Physics news on Phys.org
  • #2
xeon123 said:
I'm trying to prove by induction the expression:

[itex]\sum_{i=1}^{n-1}=\frac{n(n-1)}{2}[/itex]
There appears to be something missing here! What is being summed?

For the base case, n=2, S(2)=[itex]\frac{2(2-1)}{2}=1[/itex]

For S(n+1)=[itex]\frac{(n+1)((n+1)-1)}{2}[/itex] I have:

S(n+1) = [itex]\frac{n(n-1)}{2}[/itex] + (n+1) <--- Is this correct?

I don't know what is the term for n+1. Any help?
No one can tell you until you tell us what is being summed.
 
  • #3
I corrected in the first message now.
 
  • #4
I solved. Here's the solution. Can you check it if it's right?

For n=2, I got
0+1=[itex]\frac{2(2-1)}{2}[/itex]

For n=3,
0+1+2=[itex]\frac{3(3-1)}{2}[/itex]

So, for n, I got
0+1+2+3+...+n-1=[itex]\frac{n(n-1)}{2}[/itex]

For n+1 I got
0+1+2+3+...+n-1+n=[itex]\frac{(n+1)(n+1-1)}{2}=\frac{(n+1)(n)}{2}[/itex]

For the LHS

LHS=[itex]\frac{n(n-1)}{2}+n=\frac{n(n-1)+2n}{2}=\frac{n^2-n+2n}{2}=\frac{n^2+n}{2}[/itex]

For the RHS
RHS=[itex]\frac{(n+1)(n)}{2}=\frac{n^2+n}{2}[/itex]

So, the LHS = RHS, proofing that [itex]\frac{n(n-1)}{2}[/itex] is correct for any n.

Is this solution correct?
 
  • #5
What you have written is basically a "proof by induction" and, yes, it is correct.

Actually, the first thing I would do is write that as
[tex]\sum_{i= 1}^{n- 1} n- 1= \sum_{j= 0}^n j[/tex]
where I have taken j= i- 1.

If I really didn't want to do that, I might note that
[tex]\sum_{i=1}^{n-1}= n\sum_{i= 1}^n 1- \sum_{i=1}^{n- 1}i[/tex]
 

FAQ: Proof by induction an expression

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 breaking down the statement into smaller parts and then proving that it holds for the first case (usually n = 1), and then showing that if it holds for one case, it must also hold for the next case (n+1). By repeating this process, the statement can be shown to hold for all possible cases.

How is proof by induction different from other methods of proof?

Proof by induction is different from other methods of proof because it relies on a specific structure of natural numbers. It starts by proving the statement for the first case (n = 1) and then uses the principle of mathematical induction to show that it holds for all subsequent cases. Other methods of proof, such as direct proof or proof by contradiction, do not require this specific structure and can be used for a wider range of proofs.

What is the principle of mathematical induction?

The principle of mathematical induction states that if a statement is true for the first case (usually n = 1) and if it can be shown that whenever the statement is true for one case (n), it must also be true for the next case (n+1), then the statement is true for all natural numbers.

Can proof by induction be used to prove any statement?

No, proof by induction can only be used to prove statements that are true for all natural numbers. It cannot be used to prove statements that are only true for a specific set of numbers, such as even numbers or prime numbers.

What are some common mistakes to avoid when using proof by induction?

Some common mistakes to avoid when using proof by induction include assuming that the statement is true for all natural numbers without actually proving it, using the wrong base case (n = 1), and assuming that the statement is true for a specific case without showing that it is also true for the next case (n+1).

Similar threads

Replies
9
Views
943
Replies
11
Views
854
Replies
10
Views
2K
Replies
11
Views
1K
Replies
9
Views
2K
Back
Top