Advertisements
Advertisements
Question
Count the numbers between 999 and 10000 subject to the condition that there are no digit is repeated
Advertisements
Solution
Since 0 is given as a digit
We have to start filling 1000’s place.
Now 1000’s place can be filled in 9 ways (excluding 0)
Then the 100’s place can be filled in 9 ways (excluding one digit and including 0)
10’s place can be filled in (9 – 1)8 ways and unit place can be filled in (8 – 1)7 ways
So the number of 4 digit numbers are 9 × 9 × 8 × 7 = 4536 ways
APPEARS IN
RELATED QUESTIONS
How many 3-digit numbers can be formed from the digits 1, 2, 3, 4 and 5 assuming that repetition of the digits is allowed?
How many 4-letter code can be formed using the first 10 letters of the English alphabet, if no letter can be repeated?
A coin is tossed 3 times and the outcomes are recorded. How many possible outcomes are there?
How many numbers between 100 and 1000 have 4 in the units place?
How many three-digit numbers can be formed from the digits 0, 1, 3, 5, 6 if repetitions of digits are allowed?
How many three-digit numbers can be formed from the digits 0, 1, 3, 5, 6 if repetitions of digits are not allowed?
Select the correct answer from the given alternatives.
A college offers 5 courses in the morning and 3 in the evening. The number of ways a student can select exactly one course, either in the morning or in the evening
Answer the following:
A hall has 12 lamps and every lamp can be switched on independently. Find the number of ways of illuminating the hall.
There are 3 types of toy car and 2 types of toy train available in a shop. Find the number of ways a baby can buy a toy car and a toy train?
In how many ways 5 persons can be seated in a row?
Four children are running a race:
In how many ways can the first two places be filled?
Count the number of three-digit numbers which can be formed from the digits 2, 4, 6, 8 if repetitions of digits is not allowed
How many three-digit numbers are there with 3 in the unit place?
without repetition
To travel from a place A to place B, there are two different bus routes B1, B2, two different train routes T1, T2 and one air route A1. From place B to place C there is one bus route say B1, two different train routes say T1, T2 and one air route A1. Find the number of routes of commuting from place A to place C via place B without using similar mode of transportation
Count the total number of ways of answering 6 objective type questions, each question having 4 choices
Find the value of 4! + 5!
Evaluate `("n"!)/("r"!("n" - "r")!)` when n = 10, r = 3
A candidate is required to answer 7 questions out of 12 questions, which are divided into two groups, each containing 6 questions. He is not permitted to attempt more than 5 questions from either group. Find the number of different ways of doing question
Find the number of integers greater than 7000 that can be formed with the digits 3, 5, 7, 8 and 9 where no digits are repeated.
