Home
Class 12
MATHS
The sum of all possible numbers greater ...

The sum of all possible numbers greater than 10,000 formed by using `{1, 3, 5, 7, 9}` is

A

6666600

B

932460

C

6660000

D

1968

Text Solution

Verified by Experts

The correct Answer is:
A
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS & COMBINATIONS

    AAKASH SERIES|Exercise EXERCISE-II|229 Videos
  • PARTIAL FRACTIONS

    AAKASH SERIES|Exercise PRACTICE EXERCISE|31 Videos
  • PROBABILITY

    AAKASH SERIES|Exercise Practise Exercise|165 Videos

Similar Questions

Explore conceptually related problems

The sum of all the numbers greater than 10000 formed by using digits 0, 2, 4, 6, 8, no digit being repeated in any number, is equal to

The number of numbers greater than 50,000 that can be formed by using the digits 5, 6, 6, 7, 9 is

Number of numbers greater than 24000 can be formed by using digits 1, 2, 3, 4, 5 when no digit being repeated is

Find the sum of all 4- digited numbers that can be formed using the digits 1,3,5,7,9.

The number of five digited numbers greater than 50000 that can be formed by using all the digits 0,1,1,5,9 is

The number of numbers greater than 23000 can be formed from 1, 2, 3, 4, 5 is

AAKASH SERIES-PERMUTATIONS & COMBINATIONS-PRACTICE EXERCISE
  1. All the numbers that can be formed using the digits 1,2,3,4,5 a...

    Text Solution

    |

  2. The sum of numbers formed by taking all the digits 2, 4, 6, 8 is

    Text Solution

    |

  3. The sum of all possible numbers greater than 10,000 formed by using {1...

    Text Solution

    |

  4. The sum of all the numbers greater than 10000 formed by using digits 0...

    Text Solution

    |

  5. The number of ways that all the letters of the word SWORD can ...

    Text Solution

    |

  6. The number of ways of 5 letters put in 5 addressed envelopes so that o...

    Text Solution

    |

  7. Ravish writes letters to his five friends and addresses the correspond...

    Text Solution

    |

  8. Statement-I : The number of ways of arranging the letters of the word ...

    Text Solution

    |

  9. If a, b, c are the number of functions, injections, constant functions...

    Text Solution

    |

  10. Match the following {:("Word","Number of permutations by using all t...

    Text Solution

    |

  11. Assertion (A) : There are three doors to a room. The number of ways in...

    Text Solution

    |

  12. If ""^(35)C(n+7)=""^(35)C(4n-2), then all the values of n are given by

    Text Solution

    |

  13. IF ""^(15)C(r+3)=""^(15)C(2r-3), then r=

    Text Solution

    |

  14. ""^(n-2)C(r)+2.""^(n-2)C(r-1)+""^(n-2)C(r-2) is equal to

    Text Solution

    |

  15. If ""^(18)C(r)=""^(18)C(r+2) then ""^(R )C(5)=

    Text Solution

    |

  16. If ""^(n)C(4)=""^(n)C(8), then ""^(n)C(2) is

    Text Solution

    |

  17. ""^(29)C(5)+sum(r=0)^(4)""^((33-r))C(4)=

    Text Solution

    |

  18. ""^(15)C(8)+""^(15)C(9)-""^(15)C(6)-""^(15)C(7) is equal to

    Text Solution

    |

  19. If ""^(18)C(15)+2(""^(18)C(16))"+"^(17)C(16)+1=""^(n)C(3) then n is

    Text Solution

    |

  20. ""^(14)C(4)+sum(j=1)^(4)""^((18-j))C(3) is equal to

    Text Solution

    |