Proof by Induction: Proving ∑(-1)ii2 = (-1)n n(n+1)/2

  • Thread starter Thread starter simmonj7
  • Start date Start date
  • Tags Tags
    Induction Proof
Click For Summary
SUMMARY

The discussion focuses on proving the formula ∑ (-1)ii² = (-1)ⁿ n(n+1)/2 for natural numbers n using mathematical induction. The proof involves two main steps: the basis step, where the formula is verified for n=1, and the inductive step, where the assumption for n=k is used to prove it for n=k+1. The key insight is recognizing the need to factor out (-1)^(k+1) during the inductive step, which simplifies the expression and confirms the validity of the formula.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with summation notation
  • Knowledge of polynomial expressions
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the principles of mathematical induction in depth
  • Practice solving summation problems involving alternating series
  • Learn about polynomial identities and their proofs
  • Explore advanced topics in series convergence and divergence
USEFUL FOR

Students studying mathematics, particularly those focusing on algebra and proof techniques, as well as educators looking for examples of induction proofs in their curriculum.

simmonj7
Messages
65
Reaction score
0

Homework Statement


For n ∈ N (the natural numbers), ∑ (-1)ii2 (sum from i=1 to n) = (-1)n n(n+1)/2.


Homework Equations



For proof by induction, to show that the statement, P(n) is true for all n ∈ N you must show that P(1) is true and P(k+1) is true whenever P(k) is true.

The Attempt at a Solution



Ok so here is where I am at:
We will use induction on n.
Basis step:
For n = 1, we have ∑ (-1)112 (sum from i=1 to 1) = (-1)112 = -1 and (-1)11(1+1)/2 = -1. So, when n =1, ∑ (-1)ii2 (sum from i=1 to n) = (-1)n n(n+1)/2.
Inductive step:
Suppose ∑ (-1)ii2 (sum from i=1 to k) = (-1)kk(k+1)/2. Then ∑ (-1)ii2 (sum from i=1 to k+1) = ∑ (-1)ii2 (sum from i=1 to k) + (-1)k+1(k+1) = (-1)kk(k+1)/2 + (-1)k+1(k+1) by the inductive hypothesis. So, -1kk(k+1)/2 + 2(-1)k+1(k+1)/2 = (-1kk(k+1) + 2(-1k+1)(k+1))/2 = ((-1k + -1k+1)(k+1)(k+1)+1)) /2.

And here is where I am stuck. Cause right now I have the second part i.e. (k+1)((k+1)+1)/2 right, however I can't see how to get the exponents to become -1k+1

Thanks
 
Physics news on Phys.org
simmonj7 said:

Homework Statement


For n ∈ N (the natural numbers), ∑ (-1)ii2 (sum from i=1 to n) = (-1)n n(n+1)/2.

Homework Equations



For proof by induction, to show that the statement, P(n) is true for all n ∈ N you must show that P(1) is true and P(k+1) is true whenever P(k) is true.

The Attempt at a Solution



Ok so here is where I am at:
We will use induction on n.
Basis step:
For n = 1, we have ∑ (-1)112 (sum from i=1 to 1) = (-1)112 = -1 and (-1)11(1+1)/2 = -1. So, when n =1, ∑ (-1)ii2 (sum from i=1 to n) = (-1)n n(n+1)/2.
Inductive step:
Suppose ∑ (-1)ii2 (sum from i=1 to k) = (-1)kk(k+1)/2. Then ∑ (-1)ii2 (sum from i=1 to k+1) = ∑ (-1)ii2 (sum from i=1 to k) + (-1)k+1(k+1) = (-1)kk(k+1)/2 + (-1)k+1(k+1) by the inductive hypothesis. So, -1kk(k+1)/2 + 2(-1)k+1(k+1)/2 = (-1kk(k+1) + 2(-1k+1)(k+1))/2 = ((-1k + -1k+1)(k+1)(k+1)+1)) /2.

And here is where I am stuck. Cause right now I have the second part i.e. (k+1)((k+1)+1)/2 right, however I can't see how to get the exponents to become -1k+1

Thanks


Your induction step should be looking at (-1)^k*k*(k+1)/2+(-1)^(k+1)*(k+1)^2. You seem to be missing the "^2" on the (k+1). Try it again. Factor out (-1)^(k+1) first.
 
Last edited:
Dang. Now that I see that its so easy. Thanks.
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
12
Views
2K
Replies
9
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K