48.
Assuming no digit can be used more than once, the two digit numbers divisible by 4 are:
16, 36, 48, 56, 64, 68, 84, 96
8 of them.
For any number to be divisible by 4, only the last two digits need be divisible by 4; so for three digit numbers, each of the two digit numbers above can be preceded by any of the remaining 5 digits and still be divisible by 4.
→ 5 x 8 = 40 three digit numbers are divisible by 4
→ 40 + 8 = 48 two or three digit numbers made up of the digits {1, 3, 4, 5, 6, 8, 9} are divisible by 4.
If repeats are allowed, there are an extra 2 two digit numbers (44 and 88) and each of the two digit numbers can be preceded by any of the 7 digits, making a total of 7 x 10 + 10 = 80 two and three digits numbers divisible by 4 make up of digits from the given set.
Chat with our AI personalities
There are 900 three-digit numbers, ranging from 100 to 999.
266, 267, 268
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
the answer is 135
I dont know and i really need the answer for very necessesary reason..
2 is prime, its only factors are one and itself.
12
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
4*9 = 36 so 360 is one possible answer.
it is int n=123; printf ("%d", (n/10)%10);