Home
Class 12
MATHS
Distinct 3 digit numbers are formed usi...

Distinct 3 digit numbers are formed using only the digits `1,2,3,4` with each digit used at most one in each number thus formed. The sum of all possible numbers so formed is

A

6660

B

3330

C

2220

D

none

Text Solution

Verified by Experts

The correct Answer is:
A
Promotional Banner

Topper's Solved these Questions

  • THEORY AND EXERCISE BOOK

    MOTION|Exercise EXERCISE - 2 (LEVEL -II)|18 Videos
  • THEORY AND EXERCISE BOOK

    MOTION|Exercise EXERCISE -3|23 Videos
  • THEORY AND EXERCISE BOOK

    MOTION|Exercise EXERCISE - 4 (LEVEL -II)|22 Videos
  • TANGENT & NORMAL

    MOTION|Exercise EXERCISE 4|14 Videos
  • THREE DIMENSIONAL GEOMETRY (3 -D)

    MOTION|Exercise SOLVED EXAMPLE|33 Videos

Similar Questions

Explore conceptually related problems

The number of 3 digit numbers can be formed by using the digits 1,2,3,4

The number of 5 digit numbers formed using the digits 1,1,2,2,3 is

The six digit numbers that can be formed using digits 1,3,5,7,9 such that each digit is used at least once.

Find the number of 4 digit odd numbers that can be formed using the digit 4,6,7,9,3 so that each digit occurs at most once in each number.

A two digit number is to be formed using the digits 0,1,2,3 Repetion of the digits is allowed .Find the prochased that a number so formed is a prime number

How many numbers greater than 40000 can be formed using the digits 1,2,3,4 and 5 if each digit is used only once in each number?

How many odd numbers greter than 8000 can be formed using the digits 2,3,4,5 nd 8 if each digit is used only once in each number?

How many numbers greater than 3000 can be formed using the digits 0,1,2,3,4, and 5, so that each digit occurs at most once in each number?

Write all 3 -digit numbers using the digit 2,3,5, taking each digit only once.

Write all 3-digit numbers using the digits 1, 3, 5 taking each digit only once.

MOTION-THEORY AND EXERCISE BOOK-EXERCISE -2 (LEVEL - I)
  1. How many ways are there to arrange the letters in the word GARDEN with...

    Text Solution

    |

  2. If the letters of the word SACHIN are arranged in all possible ways...

    Text Solution

    |

  3. Numbers greater than 1000 but less than 4000 are formed using the digi...

    Text Solution

    |

  4. Total number of four digit odd numbers that can be formed by using 0, ...

    Text Solution

    |

  5. Fifty college teachers are surveyed as to their possession of colour T...

    Text Solution

    |

  6. The number of ways in which 6 men and 5 women can dine at a round tabl...

    Text Solution

    |

  7. Three vertices of a convex n sided polygon are selected. If the number...

    Text Solution

    |

  8. There are 12 guests at a dinner party. Supposing that the master and m...

    Text Solution

    |

  9. Let P(n) denotes the number of ways of selecting 3 people out of 'n' s...

    Text Solution

    |

  10. If ""(n)C(r) denotes the number of combinations of n different things ...

    Text Solution

    |

  11. A student is to answer 10 out of 13 questions in an examination such t...

    Text Solution

    |

  12. There are 100 different books in a shelf. Number of ways in which 3 bo...

    Text Solution

    |

  13. Find the number of positive integral solutions satisfying the equation...

    Text Solution

    |

  14. The number of ways of distributing 8 identical balls in 3 distinct box...

    Text Solution

    |

  15. Find the number of groups that can be made from 5 different green ball...

    Text Solution

    |

  16. Find the number of ways of dividing 52 cards among four players equ...

    Text Solution

    |

  17. In how many ways can 8 different books be distributed among 3 students...

    Text Solution

    |

  18. The sum of all numbers greater than 1000 formed by using the digits 1,...

    Text Solution

    |

  19. Distinct 3 digit numbers are formed using only the digits 1,2,3,4 wit...

    Text Solution

    |

  20. The sum of integers from 1 to 100 that are divisible by 2 or 5 is

    Text Solution

    |