Advertisements
Advertisements
प्रश्न
How many 6-digit numbers can be formed from the digits 0, 1, 3, 5, 7 and 9 which are divisible by 10 and no digit is repeated?
Advertisements
उत्तर
Those numbers divisible by 10 are those in which 0 is placed in the ones place.
Therefore, 0 is fixed at the units place.
Therefore, there will be as many ways as there are ways of filling 5 vacant places 
in succession by the remaining 5 digits (i.e., 1, 3, 5, 7 and 9).
The 5 vacant places can be filled in 5! ways.
Hence, required number of 6-digit numbers = 5! = 120
APPEARS IN
संबंधित प्रश्न
Determine n if `""^(2n)C_3 : ""^nC_3 = 11: 1`
In an examination, a question paper consists of 12 questions divided into two parts i.e., Part I and Part II, containing 5 and 7 questions, respectively. A student is required to attempt 8 questions in all, selecting at least 3 from each part. In how many ways can a student select the questions?
It is required to seat 5 men and 4 women in a row so that the women occupy the even places. How many such arrangements are possible?
In a class there are 27 boys and 14 girls. The teacher wants to select 1 boy and 1 girl to represent the class in a function. In how many ways can the teacher make this selection?
From among the 36 teachers in a college, one principal, one vice-principal and the teacher-incharge are to be appointed. In how many ways can this be done?
Since the number has to be greater than 8000, the thousand's place can be filled by only two digits, i.e. 8 and 9.
Now, the hundred's place can be filled with the remaining 4 digits as the repetition of the digits is not allowed.
The ten's place can be filled with the remaining 3 digits.
The unit's place can be filled with the remaining 2 digits.
Total numbers that can be formed = `2xx4xx3xx2=48`
How many odd numbers less than 1000 can be formed by using the digits 0, 3, 5, 7 when repetition of digits is not allowed?
How many different numbers of six digits can be formed from the digits 3, 1, 7, 0, 9, 5 when repetition of digits is not allowed?
A number lock on a suitcase has 3 wheels each labelled with ten digits 0 to 9. If opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible? Also, find the number of unsuccessful attempts to open the lock.
If α = mC2, then find the value of αC2.
In how many ways can a football team of 11 players be selected from 16 players? How many of these will
exclude 2 particular players?
How many different selections of 4 books can be made from 10 different books, if two particular books are never selected?
A student has to answer 10 questions, choosing at least 4 from each of part A and part B. If there are 6 questions in part A and 7 in part B, in how many ways can the student choose 10 questions?
Find the number of diagonals of , 1.a hexagon
In how many ways can a committee of 5 persons be formed out of 6 men and 4 women when at least one woman has to be necessarily selected?
We wish to select 6 persons from 8, but if the person A is chosen, then B must be chosen. In how many ways can the selection be made?
A bag contains 5 black and 6 red balls. Determine the number of ways in which 2 black and 3 red balls can be selected.
Out of 18 points in a plane, no three are in the same straight line except five points which are collinear. How many (i) straight lines
How many different words, each containing 2 vowels and 3 consonants can be formed with 5 vowels and 17 consonants?
There are 3 letters and 3 directed envelopes. Write the number of ways in which no letter is put in the correct envelope.
If 20Cr = 20Cr−10, then 18Cr is equal to
If C (n, 12) = C (n, 8), then C (22, n) is equal to
5C1 + 5C2 + 5C3 + 5C4 +5C5 is equal to
Given 11 points, of which 5 lie on one circle, other than these 5, no 4 lie on one circle. Then the number of circles that can be drawn so that each contains at least 3 of the given points is
Find the value of 15C4 + 15C5
In a small village, there are 87 families, of which 52 families have atmost 2 children. In a rural development programme 20 families are to be chosen for assistance, of which atleast 18 families must have at most 2 children. In how many ways can the choice be made?
In how many ways a committee consisting of 3 men and 2 women, can be chosen from 7 men and 5 women?
The straight lines l1, l2 and l3 are parallel and lie in the same plane. A total numbers of m points are taken on l1; n points on l2, k points on l3. The maximum number of triangles formed with vertices at these points are ______.
If 20 lines are drawn in a plane such that no two of them are parallel and no three are concurrent, in how many points will they intersect each other?
The number of triangles that are formed by choosing the vertices from a set of 12 points, seven of which lie on the same line is ______.
Three balls are drawn from a bag containing 5 red, 4 white and 3 black balls. The number of ways in which this can be done if at least 2 are red is ______.
In a football championship, 153 matches were played, Every two teams played one match with each other. The number of teams, participating in the championship is ______.
A committee of 6 is to be chosen from 10 men and 7 women so as to contain atleast 3 men and 2 women. In how many different ways can this be done if two particular women refuse to serve on the same committee ______.
There are 12 points in a plane of which 5 points are collinear, then the number of lines obtained by joining these points in pairs is 12C2 – 5C2.
Eighteen guests are to be seated, half on each side of a long table. Four particular guests desire to sit on one particular side and three others on other side of the table. The number of ways in which the seating arrangements can be made is `(11!)/(5!6!) (9!)(9!)`.
All possible numbers are formed using the digits 1, 1, 2, 2, 2, 2, 3, 4, 4 taken all at a time. The number of such numbers in which the odd digits occupy even places is ______.
There are 12 persons seated in a line. Number of ways in which 3 persons can be selected such that atleast two of them are consecutive, is ______.
A regular polygon has 20 sides. The number of triangles that can be drawn by using the vertices but not using the sides is
