Questions & Answers for: sum 1

...are 'x': Sum(a,x)= 16 / Sum(b,y)= 15 etc. Can you please help. Thanks x x y y a 1 3 1 3 a 2 5 2 5 a 4 1 4 1 b 4 1 4 1 b 3 4 3 4 b 1 2 1 2 c 4 1 4 1 c 4 4 4 4 c 4 4 4 4 c 4 1 4 1 in outlook or

...me. Thanks. Q.2#  Dim n, sum as Double Dim i as Integer n=100 sum=0 for i=1 to n sum=sum+1/n next i Q.3#  Dim sum as Double sum=0 for i=1 to 99 if i%2 <> 0 then sum=sum+i end if next ...

...Y(N,N), Z(N,N) DOUBLE PRECISION SUM READ, X READ, Y DO 200 J=1, N DO 100 K=1, N SUM = 0.0 DO 50 L=1, N SUM = SUM + X(J,L) * Y(L,K) 50 CONTINUE Z(J,K) = SUM 100 CONTINUE 200 CONTINUE WRITE, Z ...

...1;i The sum of all odd numbers, up to the odd number (2n-1) is n^2. To illustrate this, think of the following example: What is 1 + 3 + 5 + ... + 997 + 999 ? Well, 999 is of the form 2(500)-1, so n, ...

) { int num = 0, i = 1, sum = 0; cout << "Enter a positive integer: "; cin >> num; while (i <= num) { sum += i; i++; } cout << "The sum is " << sum << endl; return 0;

sum to n terms of the series 1+5+12+22.......... You did not provide a general (n) term. However, I figured it to be something involving n^2. Hence the sum to n terms can be of the form: xn^3 + yn^2 +

...terms in sum. (48+3048)=(56+3040)=(64+3032)=(72+3024)=3096 and there are (377-1)/2=188 pairs whose sum is 3096. Only term that is not in such pair is 40. Finally sum is

...units w=width =1 unit Perimeter = sum of the measures of all sides. 2 sides with measure L: sum of lengths=2*L 2 sides with measure w: sum of widths=2*w Perimeter = 2L+2w=2(L+w)=2(1+3)=8

...units w=width =1 unit Perimeter = sum of the measures of all sides. 2 sides with measure L: sum of lengths=2*L 2 sides with measure w: sum of widths=2*w Perimeter = 2L+2w=2(L+w)=2(1+3)=8

...-7/10 + 1/4 the sum? ssame as -6/x/4.2 the sum of -7/10 + 1/4 is -9/20 or -0.45 If you change the fractions to a common denominator by multiplying by 2 and 5 respectively you get -14/20 + 5/20 = ...