Home
Class 12
MATHS
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.

A

216

B

240

C

600

D

3125

Text Solution

Verified by Experts

The correct Answer is:
A
Promotional Banner

Topper's Solved these Questions

  • 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
  1. The number of four-digit numbers strictly greater than 4321 that can b...

    Text Solution

    |

  2. The number of seven digit integers, with sum of the digits equal to 10...

    Text Solution

    |

  3. A five-digit numbers divisible by 3 is to be formed using the numberal...

    Text Solution

    |

  4. A number of 18 guests have to be seated, half on each side of a lon...

    Text Solution

    |

  5. If r,s,t are prime numbers and p,q are the positive integers such that...

    Text Solution

    |

  6. Let ngeq2 be integer. Take n distinct points on a circle and join each...

    Text Solution

    |

  7. Let A be a set of n distinct elements. Then the total number of distin...

    Text Solution

    |

  8. In a certain test, a students gave wrong answers to at least i questio...

    Text Solution

    |

  9. A committee of 12 is to be formed from nine women and eight men. In...

    Text Solution

    |

  10. about to only mathematics

    Text Solution

    |

  11. A box contains 2 white balls, 3 black balls & 4 red balls. In how many...

    Text Solution

    |

  12. 7 relatives of a man comprises 4 ladies and 3 gentlemen, his wife has ...

    Text Solution

    |

  13. m men and n women are to be seated in a row so that no two women sit...

    Text Solution

    |

  14. m n squares of the equal size are arranged to form a rectangle of dmen...

    Text Solution

    |

  15. If ""^(n)C(r -1) = 36, ""^(n)C(r) = 84 " and " ""^(n)C(r +1) = 126, th...

    Text Solution

    |

  16. Let n1<n2<n3<n4<n5 be positive integers such that n1+n2+n3+n4+n5=20...

    Text Solution

    |

  17. The total number of ways in which 5 balls of different colours can be ...

    Text Solution

    |

  18. Let n and k be positive integers such that n gt (k(k+1))/2. The number...

    Text Solution

    |

  19. about to only mathematics

    Text Solution

    |

  20. (i) In how many ways can a pack of 52 cards be divided equally a...

    Text Solution

    |