Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
OpenStudy (anonymous):
It looks like it would be 0 to me...
OpenStudy (anonymous):
How is that summation computed??
jimthompson5910 (jim_thompson5910):
how many copies of 1 are being added up here?
jimthompson5910 (jim_thompson5910):
a number line may help
|dw:1443247594593:dw|
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
n-(-n) +1 terms.
OpenStudy (anonymous):
So 2n+1 copies of 1.
jimthompson5910 (jim_thompson5910):
so really 2n+1 terms of 1 being added, yes
OpenStudy (anonymous):
Ohh I see it okay how about this one then??
OpenStudy (anonymous):
\[\sum_{-\infty}^{\infty} u[k] \]
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
That's the same as it going from 0 to infinity.
jimthompson5910 (jim_thompson5910):
how is the u[k] function defined?
OpenStudy (anonymous):
It's 1 when greater than 0 and 0 when less than 0.
OpenStudy (anonymous):
So we repalce by 1 and... Ohh wait...
OpenStudy (anonymous):
..........
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
jimthompson5910 (jim_thompson5910):
ok so the unit step function
OpenStudy (anonymous):
Thanks.
jimthompson5910 (jim_thompson5910):
you're welcome. I'm glad to be of help
OpenStudy (anonymous):
Wait question.
OpenStudy (anonymous):
@jim_thompson5910 , dosen't the 2N+1 just tell us there are 2N+1 terms?
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
Not that there are 2N+1 copies of 1?
jimthompson5910 (jim_thompson5910):
we have 2n+1 copies of 1+1+1+....+1
jimthompson5910 (jim_thompson5910):
as a shortcut
1+1+1+....+1 = (2n+1)*1 = 2n+1
OpenStudy (anonymous):
Ooooo I see. Thank you!
jimthompson5910 (jim_thompson5910):
you might have this formula in your book
\[\Large \sum_{k = m}^{n} c = (n-m+1)*c\]
c is a constant
there are n-m+1 terms of c being added. So as a shortcut, we really have (n-m+1)*c
if you start at m = 0, then you have (n+1)*c
if you start at m = 1, then you have n*c which may be what you're used to
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
Interesting. I actually did not know that. Thank you!