Spivak Calculus Summation problem

Click For Summary

Homework Help Overview

The discussion revolves around a summation problem from Spivak's Calculus, specifically dealing with the manipulation of series such as "1 + ... + n" and the sum of odd numbers. Participants express confusion regarding the transition between different forms of summation and the reasoning behind certain steps in the solution process.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants explore the summation of integers and odd numbers, questioning how to derive relationships between these sums. There are attempts to visualize the sums through pairing and folding methods, as well as inquiries into specific steps in Spivak's solution.

Discussion Status

The discussion is ongoing, with participants providing insights and alternative methods to approach the problem. Some guidance has been offered regarding the manipulation of sums, but there remains a lack of consensus on certain steps and interpretations, indicating a productive exploration of the topic.

Contextual Notes

Participants mention issues with LaTeX formatting and express the need for clearer definitions and examples, particularly regarding the sums of even integers and the overall summation process.

Wumbolog
Messages
13
Reaction score
0
Member warned about not using the homework template
Hi, I've enclosed my problem and attempt at solution below. I had problems with the latex so I photographed a picture of my work. The first top half is my attempt at the solution and the bottom is the solution that Spivak provides.

I don't understand how he reached his solution and I don't understand how to manipulate these equations "1+...+n"

Your feedback is much appreciated.
 

Attachments

  • spivak1.jpg
    spivak1.jpg
    26 KB · Views: 474
Physics news on Phys.org
Do you understand how he got from the first to the second line?
 
for 1+...+n, let's take n=11 as an example: If you think of 1+2+3+...+11, that is = (11+1) + (10+2) + (9+3) + ... + (6+6) and these terms are all 12 or (n+1). Now, how many these (n+1) terms do you get?
 
Once you have figured that out, then look at Spivak's first line: 1 + 3 + 5 + 7 + ...+ (2n - 1)
What can you add to this to make it look like 1 + 2 + 3 + 4 + ...+ (2n - 1) + 2n which you know how to solve?
 
muscaria said:
for 1+...+n, let's take n=11 as an example: If you think of 1+2+3+...+11, that is = (11+1) + (10+2) + (9+3) + ... + (6+6) and these terms are all 12 or (n+1). Now, how many these (n+1) terms do you get?

You get n amount of n+1? I am sorry I still don't get it
 
muscaria said:
Once you have figured that out, then look at Spivak's first line: 1 + 3 + 5 + 7 + ...+ (2n - 1)
What can you add to this to make it look like 1 + 2 + 3 + 4 + ...+ (2n - 1) + 2n which you know how to solve?
I add even numbers
 
Wumbolog said:
You get n amount of n+1? I am sorry I still don't get it
Ok maybe I should have explained a bit more what I mean and taken n to be an even number. So imagine you have n numbers where n is even, say n = 10 and you're going to add them all up together. So they're all lined up one after the next 1 2 3 4 5 6 7 8 9 10. Now you could fold this line (or wrap it) so that the 10 is under the 1, the 9 is under the 2, the 8 is under the 3 etc, like:
1 2 3 4 5
10 9 8 7 6

The point of pairing them this way is because as go to the right in the top line you go +1 whereas as you go to the right in the bottom line you go -1 so that the pairs always add to 11. So now how many pairs of 11 do you get?
 
Wumbolog said:
I add even numbers

Yes precisely you add even numbers to them and now you sum 1+2+3+...+2n and because you added all those even numbers you have to subtract them also (so that you have effectively added 0 to your equation). How do you think Spivak's term -2(1+2+...+n) is related to what I just said?
Does it make sense?
 
Wumbolog said:
I had problems with the latex
What problem did you have ?
 
  • #10
muscaria said:
Ok maybe I should have explained a bit more what I mean and taken n to be an even number. So imagine you have n numbers where n is even, say n = 10 and you're going to add them all up together. So they're all lined up one after the next 1 2 3 4 5 6 7 8 9 10. Now you could fold this line (or wrap it) so that the 10 is under the 1, the 9 is under the 2, the 8 is under the 3 etc, like:
1 2 3 4 5
10 9 8 7 6

The point of pairing them this way is because as go to the right in the top line you go +1 whereas as you go to the right in the bottom line you go -1 so that the pairs always add to 11. So now how many pairs of 11 do you get?
muscaria said:
Yes precisely you add even numbers to them and now you sum 1+2+3+...+2n and because you added all those even numbers you have to subtract them also (so that you have effectively added 0 to your equation). How do you think Spivak's term -2(1+2+...+n) is related to what I just said?
Does it make sense?
Don't do too much of the solution for the OP.
 
  • #11
SammyS said:
Don't do too much of the solution for the OP.
Duly noted.
 
  • #12
muscaria said:
Yes precisely you add even numbers to them and now you sum 1+2+3+...+2n and because you added all those even numbers you have to subtract them also (so that you have effectively added 0 to your equation). How do you think Spivak's term -2(1+2+...+n) is related to what I just said?
Does it make sense?

So then I have 1+2+3+4+5+(2n-1)+2n

But when I subtract the sum of 2n which is 2(1+...+n)
the second line is 1+2+3+4+5+2n-2(1+...+n), the odd number (2n-1) somehow disappeared and the number I am supposed to add to get zero -2(1+...+n) is still there

I don't understand
 
  • #13
Wumbolog said:
So then I have 1+2+3+4+5+(2n-1)+2n

But when I subtract the sum of 2n which is 2(1+...+n)
the second line is 1+2+3+4+5+2n-2(1+...+n), the odd number (2n-1) somehow disappeared and the number I am supposed to add to get zero -2(1+...+n) is still there

I don't understand
What do you mean by "the sum of 2n" ?
 
  • #14
SammyS said:
What do you mean by "the sum of 2n" ?
I put what I meant, which is 2(1+...+n)
 
  • #15
Wumbolog said:
So then I have 1+2+3+4+5+(2n-1)+2n

But when I subtract the sum of 2n which is 2(1+...+n)
the second line is 1+2+3+4+5+2n-2(1+...+n), the odd number (2n-1) somehow disappeared and the number I'm supposed to add to get zero -2(1+...+n) is still there

I don't understand
Rather than calling this " the sum of 2n " it's much clearer to say something like, " the sum of all even integers from 2 through 2n. "

In Latex that's ##\displaystyle\ \sum_{i=1}^{n}2i\ ## .

And you have correctly stated that gives ##\displaystyle\ 2\left(\sum_{i=1}^{n}i\right)\ ##, so that is ##\displaystyle\ 2\left(\frac{n(n+1)}{2}\right) ## .

What is the big sum, 1+2+3+4+5+(2n-1)+2n, i.e. ##\displaystyle\ \sum_{i=1}^{2n}i\ \ ? ##
.
 
  • #16
SammyS said:
Rather than calling this " the sum of 2n " it's much clearer to say something like, " the sum of all even integers from 2 through 2n. "

In Latex that's ##\displaystyle\ \sum_{i=1}^{n}2i\ ## .

And you have correctly stated that gives ##\displaystyle\ 2\left(\sum_{i=1}^{n}i\right)\ ##, so that is ##\displaystyle\ 2\left(\frac{n(n+1)}{2}\right) ## .

What is the big sum, 1+2+3+4+5+(2n-1)+2n, i.e. ##\displaystyle\ \sum_{i=1}^{2n}i\ \ ? ##
.
I can't figure this out, please help. I need a worked example I can refer to
 
  • #17
upload_2015-5-9_23-12-32.png


If you understand the results shown above, I think we can get the correct result using a alternative method to Spivak's.

Now consider the sum of the first n odd natural numbers, ##\displaystyle\ \sum_{i=1}^{n}(2i-1)\ ##.

Split that up into ##\displaystyle\ \sum_{i=1}^{n}(2i)-\sum_{i=1}^{n}(1)\\ ##

What do those last two sums give?
 

Similar threads

  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 17 ·
Replies
17
Views
11K
  • · Replies 3 ·
Replies
3
Views
3K