Assuming you want to find the greater of 3 values that are in a table, you could do it this way: CREATE TABLE #T ( Column1 INT, Column2 INT, Column3 INT ) INSERT #T VALUES (-100, 25, 1000) INSERT #T VALUES (2, 66, 10) INSERT #T VALUES (110, 0, 200) INSERT #T VALUES (-1, -2, -3) INSERT #T VALUES (1, 2, 3) INSERT #T VALUES (3, 2, 1) INSERT #T VALUES (1, 3, 2) INSERT #T VALUES (2, 3, 3) SELECT CASE WHEN Column1 >= Column2 AND Column1 >= Column3 THEN Column1 WHEN Column2 >= Column3 AND Column2 >= Column1 THEN Column2 ELSE Column3 END AS MaxValue FROM #T DROP TABLE #T
24 three digit numbers if repetition of digits is not allowed. 4P3 = 24.If repetition of digits is allowed then we have:For 3 repetitions, 4 three digit numbers.For 2 repetitions, 36 three digit numbers.So we have a total of 64 three digit numbers if repetition of digits is allowed.
1/2, 3/6, 4/8
468, 486, 648, 684, 846, 864.
Tables use lines and numbers instead of using bars words and numbers..... :) Also, you can't put your beer down on a bar graph :-)
35,152,000 (assuming that 000 is a valid number, and that no letter combinations are disallowed for offensive connotations.) Also, no letters are disallowed because of possible confusion between letters and numbers eg 0 and O.
Compare the first two numbers with the ternary operator. Store the result in a temporary variable. Compare the temporary variable with the third number, again using the ternary operator.
smallest=1234 greatest=4321
87603
i dont know what that means does anyone get this"find the greatest common factor of the numbers using prime factorization We'll be eager to jump on it as soon as you give us the numbers.
No 5291 is not a prime using 2 numbers. It is a prime using three numbers.
Using cheque numbers to find which ones have been presented (appearing on the bank statement)
With printf.Example:for (i=0; i
The greatest difference is 541
Yes, you can.
The GCF is 12. The next greatest is 6.
N = x If y < N then N = Y If z < N then N = z Print N
Using 1, 2, and 3, you can make 27 whole numbers.