A five-digit numbers divisible by 3 is t...

A five-digit numbers divisible by 3 is to be formed using the numberals 0, 1,2,3,4 and 5, without repetition. Find the total number of ways in which this can be done.

216

600

240

3125

Text Solution

Verified by Experts

The correct Answer is:

Topper's Solved these Questions

PERMUTATION & COMBINATION
VMC MODULES ENGLISH|Exercise LEVEL-1|125 Videos
PERMUTATION & COMBINATION
VMC MODULES ENGLISH|Exercise LEVEL-2|88 Videos
MOCK TEST 9
VMC MODULES ENGLISH|Exercise MATHEMATICS (SECTION 2)|5 Videos
PROBABILITY
VMC MODULES ENGLISH|Exercise JEE ADVANCED (ARCHIVE)|102 Videos

Similar Questions

Explore conceptually related problems

A 5-digit number divisible by 3 is to be formed using the number 0,1,2,3,4 and 5 without repetiition. Find total of ways in whiich this can be done.

A five digit number divisible by 3 is to be formed using the digits 0,1,2,3,4 and 5 without repetitioon. If the tota number of ways in which this casn bedone is n^3, then |__n= (A) 720 (B) 120 (C) 48 (D) 12

A five digit number divisible by 3 is to be formed using the numerals 0, 1, 2, 3, 4 and 5, without repetition. The total number of ways this can be done, is

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 five digit number divisible by 3 is to be formed using the digits 0,1,3,5,7,9 without repetitions. The total number of ways this can be done is

Statement-1: A 5-digit number divisible by 3 is to be formed using the digits 0,1,2,3,4,5 without repetition, then the total number of ways this can be done is 216. Statement-2: A number is divisible by 3, if sum of its digits is divisible by 3.

A five digits number divisible by 3 is to be formed using the number 0,1,2,3,4 and 5 without repetition. The number of such numbers are m^(3) then m is equal to

A three-digit number is to be formed using the digits 0, 1, 2, 3, 4, and 5, without repetition.

An eight digit number divisible by 9 is to be formed using digits from 0 to 9 without repeating the digits. The number of ways in which this can be done is

Five digit number divisible by 3 is formed using 0 1 2 3 4 6 and 7 without repetition Total number of such numbers are

VMC MODULES ENGLISH-PERMUTATION & COMBINATION-JEE ARCHIVE

A five-digit numbers divisible by 3 is to be formed using the numberal...
Text Solution
|
The number of integers greater than 6000 that can be formed using the ...
Text Solution
|
How many different nine-digit numbers can be formed from the digits of...
Text Solution
|
An n-digit number is a positive number with exactly n digits. Nine hun...
Text Solution
|
In a college of 300 students, every student reads 5 newspapers and eve...
Text Solution
|
Eight chairs are numbered 1 to 8. Two women and three men wish to oc...
Text Solution
|
Ten different letters of an alphabet are given. Words with five letter...
Text Solution
|
let T(n) be the number of all possible triangels formed by joining ver...
Text Solution
|
Find the value of ""^(47)C4+ underset (r=1) overset( 5) sum ""^(52-r...
Text Solution
|
True or false 1. The product of any 2. r 3. 4. consecutive natural ...
Text Solution
|
The letters of the word COCHIN are permuted and all the permutation...
Text Solution
|
The number of arrangements of the letters of the word BANANA in whic...
Text Solution
|
The number of divisors of the form 4K + 2 , K ge 0 of the integers 24...
Text Solution
|
Find the number of ways in which six '+' and four '-' signs can be arr...
Text Solution
|
There are five balls of different colours and five boxes of colours sa...
Text Solution
|
The number of ways of choosing 10 objects out of 31 objects of which 1...
Text Solution
|
Suppose that 20 pillars of the same height have been erected along the...
Text Solution
|
Some identical balls are arranged in rows to form an equilateral trian...
Text Solution
|
There are m men and two women participating in a chess tournament. Eac...
Text Solution
|
A group of students comprises of 5 boys and n girls. If the number of ...
Text Solution
|
Let S be the set of all triangles in the xy-plane, each having one ver...
Text Solution
|