Home
Class 11
MATHS
A seven-digit number without repetition ...

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

Text Solution

AI Generated Solution

Promotional Banner

Topper's Solved these Questions

  • LOGARITHM

    CENGAGE ENGLISH|Exercise All Questions|173 Videos
  • PROBABILITY

    CENGAGE ENGLISH|Exercise All Questions|1 Videos

Similar Questions

Explore conceptually related problems

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

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

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

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

How many four-digit numbers can be formed by using the digits 1, 2, 3, 4, 5, 6, 7 if at least one digit is repeated.

How many four-digit numbers can be formed by using the digits 1, 2, 3, 4, 5, 6, 7 if at least one digit is repeated.

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

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

How many even numbers of 5 digits without repetition can be formed with the digits 1,2,3,4 and 5.

CENGAGE ENGLISH-PERMUTATIONS AND COMBINATIONS-All Questions
  1. There are 2 women participating in a chess tournament. Every partic...

    Text Solution

    |

  2. Five balls of different color are to be placed in three boxes of dif...

    Text Solution

    |

  3. A seven-digit number without repetition and divisible by 9 is to be fo...

    Text Solution

    |

  4. n is selected from the set {1, 2, 3,.............,100} and the number ...

    Text Solution

    |

  5. Messages are conveyed by arranging four white, one blue, and three ...

    Text Solution

    |

  6. 20 persons are sitting in a particular arrangement around a circula...

    Text Solution

    |

  7. The number of three digit numbers of the form xyz such that x lt y , z...

    Text Solution

    |

  8. A is a set containing n different elements. A subset P of A is chosen....

    Text Solution

    |

  9. Numbers greater than 1000 but not greater than 4000 which can be fo...

    Text Solution

    |

  10. Find 5C2

    Text Solution

    |

  11. The number less than 1000 that can be formed using the digits 0, 1,...

    Text Solution

    |

  12. A variable name in certain computer language must be either an alph...

    Text Solution

    |

  13. The number of five-digit numbers that contain 7 exactly once is a. ...

    Text Solution

    |

  14. The total number of flags with three horizontal strips in order, whi...

    Text Solution

    |

  15. Let A be a set of n(geq3) distance elements. The number of triplets...

    Text Solution

    |

  16. The number of possible outcomes in a throw of n ordinary dice in wh...

    Text Solution

    |

  17. In a room there are 12 bulbs of the same wattage, each having separate...

    Text Solution

    |

  18. In a city no two persons have identical set of teeth and there is n...

    Text Solution

    |

  19. Consider the five points comprising the vertices of a square and th...

    Text Solution

    |

  20. The letters of the word COCHIN are permuted and all the permutation...

    Text Solution

    |