6+n = 2n+5
if p represents your positive number, and n represents all of your negative numbers, then: |∑n| < p
The sum of n and 5 is n+ 5
void main () { int no1, sum, n; clrscr() sum = 0; n = 1; printf("\n enter the number to which sum is to be generated"); scanf("%d",&no1); while(n<=no1) { sum=sum+n; n=n+1 } printf("\n the sum of %d = %d, no1, sum"); getch (); }
The sum of p and q means (p+q). The difference of p and q means (p-q).
18 + n
void main() { int n=0,i,*p; clrscr(); printf("enter the value of n"); scanf("%d",&n); p=&n; for(i=0;i<=n;i++) { *p=*p+i; } printf("value of the sum is %d",*p); getch(); }
2(n+3)
6+n = 2n+5
The sum of (base current) plus (collector current).
The quotient of two and the sum of a number and twenty
if p represents your positive number, and n represents all of your negative numbers, then: |∑n| < p
3(n-9)
if p represents your positive number, and n represents all of your negative numbers, then: |∑n| < p
The natural number N with four factors can be expressed as N = p^3, where p is a prime number. Given that the sum of factors excluding N is 31, the factors are 1, p, p^2, and the sum of these factors is 1 + p + p^2 = 31. Solving the equation p^2 + p - 30 = 0, we find two possible values for p: p = 5 or p = -6. However, since p must be a prime number, the only valid value is p = 5. Therefore, N can have only one value, which is 5^3 = 125.
/* Discrete Fourier Transform and Power Spectrum Calculates Power Spectrum from a Time Series Copyright 1985 Nicholas B. Tufillaro */ #include #include #define PI (3.1415926536) #define SIZE 512 double ts[SIZE], A[SIZE], B[SIZE], P[SIZE]; main() { int i, k, p, N, L; double avg, y, sum, psmax; /* read in and scale data points */ i = 0; while(scanf("%lf", &y) != EOF) { ts[i] = y/1000.0; i += 1; } /* get rid of last point and make sure # of data points is even */ if((i%2) == 0) i -= 2; else i -= 1; L = i; N = L/2; /* subtract out dc component from time series */ for(i = 0, avg = 0; i < L; ++i) { avg += ts[i]; } avg = avg/L; /* now subtract out the mean value from the time series */ for(i = 0; i < L; ++i) { ts[i] = ts[i] - avg; } /* o.k. guys, ready to do Fourier transform */ /* first do cosine series */ for(k = 0; k <= N; ++k) { for(p = 0, sum = 0; p < 2*N; ++p) { sum += ts[p]*cos(PI*k*p/N); } A[k] = sum/N; } /* now do sine series */ for(k = 0; k < N; ++k) { for(p = 0, sum = 0; p < 2*N; ++p) { sum += ts[p]*sin(PI*k*p/N); } B[k] = sum/N; } /* lastly, calculate the power spectrum */ for(i = 0; i <= N; ++i) { P[i] = sqrt(A[i]*A[i]+B[i]*B[i]); } /* find the maximum of the power spectrum to normalize */ for(i = 0, psmax = 0; i <= N; ++i) { if(P[i] > psmax) psmax = P[i]; } for(i = 0; i <= N; ++i) { P[i] = P[i]/psmax; } /* o.k., print out the results: k, P(k) */ for(k = 0; k <= N; ++k) { printf("%d %g\n", k, P[k]); } }
The sum of n and 5 is n+ 5