answersLogoWhite

0

1k represents 1,000, 2k represents 2,000, and so on.

User Avatar

Wiki User

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

RossRoss
Every question is just a happy little opportunity.
Chat with Ross
CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
TaigaTaiga
Every great hero faces trials, and you—yes, YOU—are no exception!
Chat with Taiga

Add your answer:

Earn +20 pts
Q: How much is 1 k?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

How much does 1 k equal?

1 k equals 1 thousand, commonly used ingame.


How much does 1k equal?

1 k equals 1000 2 k equals 2000 and so on


How do you find the LCM of k to the 2nd power k to the 2nd power-1 and k to the 2nd power minus 2k plus 1?

Factor them. k2 = k x k k2 - 1 = (k - 1)(k + 1) k2 - 2k + 1 = (k - 1)(k - 1) Combine the factors, eliminating duplicates. k2(k + 1)(k - 1)(k - 1) = k5 - k4 - k3 + k2, the LCM


What is k in parenthesis K minus 0 then equals 1?

If you're talking about (K-0)=1, then the answer is most definitely 1.


Gaussian elimination in c?

#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(); }