P = 1 For K = 1 to M . P = P * N Next K PRINT "N raised to the power of M is "; P
To solve this problem, we need to expand the given expression (y+k)^2 and compare it to y^2 - 12y. Expanding (y+k)^2 gives y^2 + 2yk + k^2. By comparing this to y^2 - 12y, we can see that 2yk must be equal to -12y, which implies k = -6. Additionally, comparing k^2 to 0 reveals that k = 0. Therefore, the values of p and k are p = -6 and k = 0.
#include<stdio.h> #include<stdlib.h> #include<math.h> #include<conio.h> void main(void) { int K, P, C, J; double A[100][101]; int N; int Row[100]; double X[100]; double SUM, M; int T; do { printf("Please enter number of equations [Not more than %d]\n",100); scanf("%d", &N); } while( N > 100); printf("You say there are %d equations.\n", N); printf("From AX = B enter elements of [A,B] row by row:\n"); for (K = 1; K <= N; K++) { for (J = 1; J <= N+1; J++) { printf(" For row %d enter element %d please :\n", K, J); scanf("%lf", &A[K-1][J-1]); } } for (J = 1; J<= N; J++) Row[J-1] = J - 1; for (P = 1; P <= N - 1; P++) { for (K = P + 1; K <= N; K++) { if ( fabs(A[Row[K-1]][P-1]) > fabs(A[Row[P-1]][P-1]) ) { T = Row[P-1]; Row[P-1] = Row[K-1]; Row[K-1] = T; } } if (A[Row[P-1]][P-1] 0) { printf("The matrix is SINGULAR !\n"); printf("Cannot use algorithm --- exit\n"); exit(1); } X[N-1] = A[Row[N-1]][N] / A[Row[N-1]][N-1]; for (K = N - 1; K >= 1; K--) { SUM = 0; for (C = K + 1; C <= N; C++) { SUM += A[Row[K-1]][C-1] * X[C-1]; } X[K-1] = ( A[Row[K-1]][N] - SUM) / A[Row[K-1]][K-1]; } for( K = 1; K <= N; K++) printf("X[%d] = %lf\n", K, X[K-1]); getch(); }
A = P*(1+R/100)T Where A = amount P = Principal R = Interest Rate (in percentage), and T = Time Since R and T are known, you can calculate (1+R/100)T = k, say. Then A = P*k so that P = A/k
88 keys on a piano
All s is p ---->Let this be premise 1 conversion of this premise is: Some p is s. derivation of this premise is: some s is p. All p is k ------>Let this be premise 2 conversion of this premise is: Some k is p. derivation of this premise is: some p is k. Conclusion of premise 1 and premise 2: All s is p All p is k Conclusion: All s is k 5 examples: i) some k is o some o is t valid conclusions: I) some k is t II) some t is k III)some o is k IV)some t is o ii) No s is p No p is k Valid conclusions: I) No p is s II)No k is p III)some s is not p IV)some p is not k V)some p is not s VI)some k is not p iii)All s is p All p is k Valid conclusions: I)All s is k II)some s is p III)some p is k IV)some s is k V)some p is s VI)some k is p VII)some k is s vi)some s is not p some p is not k Valid conclusions: I) No valid conclusion vi)All s is p some p is k valid conclusions: I)some s is k II)some s is p III)some k is p VI)some k is s V)some p is s
K. P. Nambiathiri was born in 1951.
K. P. Ummer died in 2002.
P. K. Ojong was born in 1920.
P. K. Ojong died in 1980.
K. P. Rajagopalan was born in 1902.
K. P. Rajagopalan died in 1944.
K. P. Noorudeen was born in 1939.
P. K. Manthri died in 1984.
P. K. Balakrishnan died in 1991.
P. K. Balakrishnan was born in 1926.
K. P. Yohannan was born in 1950.