A seven-digit number without repetition and divisible by 9 is to be formed by using seven digits out of `1, 2, 3, 4 5, 6, 7, 8, 9.` The number of ways in which this can be done is (a) `9!` (b) `2(7!)` (c) `4(7!)` (d) non of these

A five-digit number divisible by 3 is to be formed using the digits 0, 1, 2, 3, 4, and 5, without repetition. The total number of ways this can done is (a) 216 (b) 240 (c) 600 (d) 3125

The number of five-digit numbers which are divisible by 3 that can be formed by using the digits 1,2,3,4,5,6,7,8 and 9 , when repetition of digits is allowed, is

The number of distinct natural numbers up to a maximum of four digits and divisible by 5, which can be formed with the digits 0, 1 , 2, 3, 4, 5, 6, 7, 8, 9 each digit not occurring more than once in each number, is a. 1246 b. 952 c. 1106 d. none of these

Find the three-digit odd numbers that can be formed by using the digits 1, 2, 3, 4, 5, 6 when the repetition is allowed.

An n-digit number is a positive number with exactly n digit Nine hundred distinct n−digit numbers are to be formed using only the three digits 2, 5, and 7. The smallest value of n for which this is possible is (a) 6 (b) 7 (c) 8 (d) 9

The total number of 5 digit numbers formed using the digits 2, 4, 6, 7, 8 if the digits are no repeated is