THE ALGEBRA OF SUMMATION NOTATION
The following problems involve the algebra (manipulation) of
summation notation. Summation notation is used to define the
definite integral of a continuous function of one variable on a closed
interval. Let's first briefly define summation notation. If f(i)
represents some expression (function) involving i, then
.
The "i=" part underneath the summation sign tells you which
number to first plug into the given expression. The number on top of
the summation sign tells you the last number to plug into the given
expression. You always increase by one at each successive step. For
example,
= 3 + 6 + 11 + 18
= 38 .
We will need the following well-known summation rules.
1.
2.
3.
(n times) = cn,
where c is a
constant.
4.
PROBLEM 1 : Evaluate
PROBLEM 2 : Evaluate
PROBLEM 3 : Evaluate
PROBLEM 4 : Evaluate
SOLUTIONS TO THE ALGEBRA OF SUMMATION NOTATION
SOLUTION 1 :
(5+8) + (5+4) + (5+2) + (5+1) =
13 + 9 + 7 + 6 =
. 35 =
: SOLUTION 2
The above step is nothing more than changing the order and )
(.grouping of the original summation
Placing 3 in front of the second summation is simply factoring 3 )
from each term in the summation. Now apply Rule 1 to the first
(.summation and Rule 2 to the second summation
15,150 + 400 =
. 15,550 =
: SOLUTION 3
(.Separate this summation into three separate summations)
(.Factor out the number 6 in the second summation)
(.Apply Rules 1, 2, and 3)
1800 + 120,600 - 2,686,700 =
. 2,567,900 =
: SOLUTION 4
Since each summation begins with i=15, WE CANNOT USE THE )
RULES IN THE FORM THAT THEY ARE GIVEN. Observe the following
(.simple method to correct this shortcoming
(.Now apply Rules 1 and 2)
(136) + (105 - 11,325)4 =
. 45,016 =
Let the following program
()int main
}
;int A = 10, B = 15, C = 20
;int *P1, *P2
;P1=&A
;P2=&C
;++P1=(*P2)*
;P1=P2
;P2=&B
;P1-=*P2*
;P1*=*P2*
;A=(*P2)++ * *P1
;P1=&A
;P2=*P1/=*P2*
;return 0
{
Complete the following table for each instruction of the above
.program
(3)
P2*
P2
P2 ref to
P1*
P1
P1 ref to
null
null
null
10
20
10
21
20
0
2
5
1
0
2
5
1
0
2
5
1
A
10
Initialization
10
P1=&A
10
;P2=&C
20
;++P1=(*P2)*
21
21
15
21
15
15
90
16
90
16
84
135
0
84
A
A
1
2
5
1
1
2
5
1
5
1
20
;P1=P2
20
;P2=&B
20
;P1-=*P2*
20
;P1*=*P2*
5
1
0
9
5
1
135
0
9
6
1
0
135
0
9
6
8
84
;A=(*P2)++ * *P1
;P1=&A
;P2=*P1/=*P2*