Home
Class 11
MATHS
A five digit number divisible by 3 is to...

A five digit number divisible by 3 is to be formed using the numerals 0, 1, 2, 3, 4, & 5 without repetition . if the total number of ways in which this can be done is `n^3`, then `(n!)/144` must be...

Text Solution

Verified by Experts

5
Promotional Banner

Topper's Solved these Questions

  • PARABOLA, ELLIPSE AND HYPERBOLA

    PATHFINDER|Exercise QUESTION BANK|66 Videos
  • PERMUTATION AND COMBINATIONS

    PATHFINDER|Exercise QUESTION BANK|81 Videos

Similar Questions

Explore conceptually related problems

A five digit number divisible by 3 has to formed using the numerals 0,1,2,3,4,5 without repetition the total number of ways in which this can

A 5-digit number is divisible by 3 and it is formed by using 0, 1, 2, 3, 4, and 5 without repetition. Find the total number of ways in which such a number can be formed ?

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

How many five -digit numbers divisible by 3 can be formed using the digits 0, 1, 2, 3. 4 and 5 when ho digit is repeated?

A five digit number is formed with the digits 1,2,3,4,5 without repetition. Find the probability that the number is divisible by 4.

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

The number of five digit numbers divisible by 3 thet can be formed using the digits 01,2,3,4,5 (when no digity is repated ) is-

A 5 figure number is formed using the digits 0,1,2,3,4 without repetition. Find the probability of it being divisible by 4.

How many numbers of five digits can be formed from the numbers 0,1,2,3,4 when repetition of digits is not allowed ?

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.

PATHFINDER-PERMUTATION AND COMBINATION-QUESTION BANK
  1. A bouquet from 11 different flowers is to be made so that it contains ...

    Text Solution

    |

  2. If .^nPr = .^nP(r + 1) and .^nCr = .^nC(r-1) then the value of n + r...

    Text Solution

    |

  3. A five digit number divisible by 3 is to be formed using the numerals ...

    Text Solution

    |

  4. Find the number of number between 300 and 3000 that can be formed with...

    Text Solution

    |

  5. A number of four different digits is formed with the help of the digit...

    Text Solution

    |

  6. A number of four different digits is formed with the help of the digit...

    Text Solution

    |

  7. A number of four different digits is formed with the help of the digit...

    Text Solution

    |

  8. A number of four different digits is formed with the help of the digit...

    Text Solution

    |

  9. A train is going from kolkata to Delhi stops at nine intermediate stat...

    Text Solution

    |

  10. If ^nPr = ^nP(r + 1) and ^nCr = ^nC(r - 1) find the value of n and r.

    Text Solution

    |

  11. Solve the inequality .^(n-1)C4 - .^(n -1)C3 - 5/4 .^(n-2)C2lt 0,n in ...

    Text Solution

    |

  12. The letters of the word OUGHT are written in all possible order and th...

    Text Solution

    |

  13. How many numbers of 5 digits can be made with the digits 0,1,2,3,4,5 w...

    Text Solution

    |

  14. There are 2n guests at a dinner party. Supposing that the master and m...

    Text Solution

    |

  15. n different things are arranged around a circle. In how many ways can ...

    Text Solution

    |

  16. How many integers between 1 and 10,00,000 have the sum of the digits e...

    Text Solution

    |

  17. Let Tn denotes the number of triangles which can be formed using the v...

    Text Solution

    |

  18. If .^nc(r-1)=10,.^nc(r)=45 and .^nc(r+1)=120 then r equals

    Text Solution

    |

  19. The total number of five digit numbers of different digits in which th...

    Text Solution

    |

  20. The number of ways in which 7 persons can be seated at a round table i...

    Text Solution

    |