Confused about this answer, michael spivak's calculus

Click For Summary
SUMMARY

The discussion centers on the formula for the sum of the first n odd numbers, represented as Σ[n, i=1](2i - 1) = 1 + 3 + 5 + ... + (2n - 1). The solution provided in the textbook transitions from the sum of odd numbers to the sum of all integers up to 2n, minus the sum of even integers up to 2n. The key steps involve using the formula for the sum of the first n integers, Σ(i) for i=1 to n = n*(n+1)/2, to derive the final result of n^2.

PREREQUISITES
  • Understanding of summation notation and series
  • Familiarity with the formula for the sum of the first n integers
  • Basic knowledge of even and odd number properties
  • Experience with algebraic manipulation and simplification
NEXT STEPS
  • Study the derivation of the formula for the sum of the first n integers, Σ(i) for i=1 to n = n*(n+1)/2
  • Explore techniques for manipulating summations in calculus
  • Learn about the properties of odd and even numbers in mathematical series
  • Review Michael Spivak's "Calculus" for additional context and examples
USEFUL FOR

Students studying calculus, particularly those grappling with series and summation concepts, as well as educators seeking to clarify these topics for their students.

rlpp
Messages
3
Reaction score
0

Homework Statement


Find the formula
Σ[n, i =1](2i - 1) = 1+3+5+...+(2n-1)


Homework Equations





The Attempt at a Solution


When I look at the back of the book , I got this solution which is

1, Sigma(2i - 1) = 1+3+5+...+(2n-1)

2, = 1+2+3+...+2n-2(1+..+n)

3, = ((2n)(2n+1)) /2 - n(n+1)

4, n^2

What i don't get is what happened from step 1 to 2 and 2 to 3?
It seems that there are hidden steps there that were not written down and therefore and I am really confused about this solution.
Thank you guys very much.
 
Physics news on Phys.org
Your given sum is the sum of all of the odd numbers up to 2n. Step 2 is pretty easy. He just rewrote that as the sum of ALL of the numbers up to 2n minus the sum of all of the even numbers up to 2n. The trick you might be missing is that the sum of all of the numbers up to n, Sigma(i) for i=1 to n is given by a formula. It's n*(n+1)/2. There's at least a couple of ways to prove that. Do you know either one?
 
Thank you very much, I am still a little confused but I will work with this formula. Spivak's calculus is so confusing lol.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
13
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
17
Views
3K
Replies
14
Views
2K
Replies
23
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 22 ·
Replies
22
Views
2K