Proving 12 - 22 + 32 - 42 + ... + (-1)n+1)n2 for Every Positive Integer n

  • Thread starter Thread starter magic88
  • Start date Start date
  • Tags Tags
    Integer Positive
Click For Summary

Homework Help Overview

This discussion revolves around a proof problem related to mathematical induction, specifically focusing on the alternating sum of squares of integers. The original poster is attempting to derive a formula for the series 12 - 22 + 32 - 42 + ... + (-1)^(n+1)n^2 for every positive integer n, using previously established results for sums of squares.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • The original poster lists specific sums for parts (a), (b), and (c) to identify patterns. They express uncertainty about how to proceed with part (c) after observing these patterns.
  • One participant suggests a relationship between the sums from parts (a) and (b) to simplify the approach for part (c), indicating that it can be expressed as (b) - (a) with substitutions.
  • Another participant emphasizes the importance of expressing the sums in terms of the first sum of squares to facilitate the proof process.

Discussion Status

The discussion is active, with participants providing guidance on how to approach the problem. The original poster has made progress by applying suggestions, leading to a potential expression for the sum in part (c). However, the proof using induction remains to be completed.

Contextual Notes

The original poster has successfully derived results for parts (a) and (b) but is struggling with part (c). The discussion includes references to specific algebraic manipulations and the principle of mathematical induction as a framework for the proof.

magic88
Messages
8
Reaction score
0

Homework Statement


This is a proof problem in the mathematical induction section of my textbook. I am having trouble with question (c).

Result: 12 + 22 + 32 + ... + n2 = n(n+1)(2n+1)/6 for every positive integer n.

(a) Use the result to determine the formula for 22 + 42 + 62 + ... + (2n)2 for every positive integer n.
  • I have already found the solution to this problem: 22 + 42 + 62 + ... + (2n)2 = (2/3)n(n+1)(2n+1) for every positive integer n.

(b) Use the result to determine the formula for 12 + 32 + 52 + ... + (2n -1)2 for every positive integer n.
  • I have already found the solution to this problem: 12 + 32 + 52 + ... + (2n -1)2 = (2/3)n(n+1)(2n+1) - 2n(n+1) + n for every positive integer n.

(c) Use (a) and (b) to determine the formula for 12 - 22 + 32 - 42 + ... + (-1)n+1)n2 for every positive integer n. Use mathematical induction to prove this.

Homework Equations



Principle of Mathematical Induction: For each positive integer n, let P(n)be a statement. If P(1) is true and the implication "If P(k), then P(k+1) is true," then P(n) is true for every positive integer n.

The Attempt at a Solution



I have found the solutions to part (a) and (b) and have proved them. (Lots of algebra involved!) But I've been trying to figure out part (c) for about an hour now, and I just don't know how to approach it.

I started by listing out a few of the sums from part (c):
  • When n = 1, sum = 1
  • When n = 2, sum = -3
  • When n = 3, sum = 6
  • When n = 4, sum = -10
  • When n = 5, sum = 15
  • When n = 6, sum = -21

And listing out sums from part (a):
  • When n = 1, sum = 4
  • When n = 2, sum = 20
  • When n = 3, sum = 56
  • When n = 4, sum = 120

And listing out sums from part (b):
  • When n = 1, sum = 1
  • When n = 2, sum = 10
  • When n = 3, sum = 35
  • When n = 4, sum = 84

I found a pattern between the three sums:
  • Part (c) sum = -3 = 1-4
  • Part (c) sum = 6 = 10-4
  • Part (c) sum = -10 = 10-20
  • Part (c) sum = 15 = 35-20
  • Part (c) sum = -21 = 56-35
(I’m sorry, I don’t really know how to explain the pattern, but if you look back at the lists of sums I made above, I think you will understand what I mean.)

I don’t know how to proceed from here. Any help is GREATLY appreciated! Please let me know if you need any clarification.

Kendra :)
 
Physics news on Phys.org
(c)=(b)-(a) with 2n replaced with n.

also, for your previous proofs for which you said you used lots of algebra, consider this:
you have

\sum_{r=1}^{n}r^{2}=\frac{1}{6}n(n+1)(2n+1)\]

(a) find

\sum_{r=1}^{n}(2r)^{2}\]
(write this in terms of the first sum)

(b) find

\sum_{r=1}^{n}(2r+1)\]
(write this in terms of the first sum too)

That should make things considerably easier
 
Last edited:
Thanks very much! Your tip about writing (a) and (b) in terms of the first sum really helped... I don't know why I didn't think of that.

I got:

(-1)^{n+1}\frac{n^2+n}{2}
 
magic88 said:
Thanks very much! Your tip about writing (a) and (b) in terms of the first sum really helped... I don't know why I didn't think of that.

I got:

(-1)^{n+1}\frac{n^2+n}{2}

No problem, glad it helped... Now all you have to do is prove your answer for (c) using induction.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
Replies
7
Views
4K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
18
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K