0.12 Or 102 if you do not want to include non integers.
The smallest 3 digit counting number less than 1000?? 100
875
I am assuming you are referring to a normal 3x3 sudoku grid, where you can only use the numbers 1-9 once in the grid, and by prime number you mean the 3digit number across and down the grid must be prime? For a number to be prime, it must end in 1, 3, 7 or 9. There are 5 places on the Sudoku grid for a number to finish and as you can only use a number once in sudoku you have one place left where the number can not be prime. This means the most you can have is 5 prime numbers.
18.You can answer it easily by considering three places for three digits of the number.The hundreds place cannot take zero hence it can take 2 values.The next two places can take all the three digits.Hence the total number of ways is 2*3*3=18.
the answer is 135
0.12 Or 102 if you do not want to include non integers.
The smallest 3 digit counting number less than 1000?? 100
196, 198, 202, 204
it is int n=123; printf ("%d", (n/10)%10);
4*9 = 36 so 360 is one possible answer.
266, 267, 268
2 is prime, its only factors are one and itself.
875
There are 900 three-digit numbers, ranging from 100 to 999.
12
111,112,121,211,122,212,221,222,113,131,311,133,313,331,333,223,232,322,233,323,332,123, 132, 213, 231, 312, 321