Questions · Page 2 of 2

2 Marks Questions

Question 512 Marks
Compute:
L.C.M. (6!,7!,8!)
Answer
We have,
8! = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 
7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 
6! = 6 × 5 × 4 × 3 × 2 × 1 
and 
$\therefore$ L.C.M. (6!,7!,8!) = 8!
View full question & answer
Question 522 Marks
How many numbers of six digits can be formed from the digits 0, 1, 3, 5, 7 and 9 when no digit is repeated? How many of them are divisible by 10?
Answer
Total number of digits = 6
we cannot have Oat the first digit of the required six-digit numbers
The digits cannot repeat in the six digits number.
$\therefore$ Total number of six digit number are = 5 × 5 × 4 × 3 × 2 × 1 = 600
Now, the six digit number can be divided by 10, if its last digit is 0.
$\therefore$ Total numbers which are divisible by 10 = 5 × 4 × 3 × 2 × 1 × 1 = 120
View full question & answer
Question 532 Marks
In how many ways can five children stand in a queue?
Answer
The total number of ways = Number of arrangements of 5 things, taken all at a time $=^5\text{P}_5$
$=\frac{5!}{(5-5)!}$
$=\frac{5\times4\times3\times2\times1}{0!}\ [\because 0!=1]$
$=120$
Hence, the total numbar of ways in which children stand in a queue is 120.
View full question & answer
Question 542 Marks
A coin is tossed five times and outcomes are recorded. How many possible outcomes are there?
Answer
Since toss of each coin can result in 2 ways.
When coin is tossed five times, the to outcomes
= 2 × 2 × 2 × 2 × 2
= 32
Hence, required number of ways is 32.
View full question & answer
Question 552 Marks
Twelve students complete in a race. In how many ways first three prizes be given?
Answer
Clearly, the total number of ways to select first three prizes is equal to the 3 students from 12 students.
$\therefore$ Number of ways to select the three prizes
= 12 × 11 × 10
= 1320
View full question & answer
Question 562 Marks
How many three-digit odd numbers are there?
Answer
The three digit numbers are 100 to 999 inclusive so there are
999 - 100 + 1 = 999 - 99 = 900
So, 900 three digit numbers If half of all numbers is odd then half of 900 is 450, there are 450 odd positive 3 digit numbers.
View full question & answer
Question 572 Marks
How many three-digit numbers are there?
Answer
We cannot have a Oat the hundred's place. So, the hundred's place can be filled with any of the 9 digits 1, 2, 3 ..... , 9.
So, there are 9 ways of filling the hundred's place.
Ten's place can be filled with any 10 digits in 10 ways.
Now, the unit's place can be filled with any 10 digits in 10 ways.
Hence, the total number of required numbers = 9 × 10 × 10 = 900
View full question & answer
Question 582 Marks
How many three-digit numbers are there, with no digit repeated?
Answer
Total number of digits = 10
Total number of 3 digit numbers $= \ ^{10}\text{P}_3 $
But these arrangements also indude those numbers which have O at hundred's place. such numbers are not 3-digit numbers.
When 0 is fixed at hundred's place, we have to arrange remaining 9 digits by taking 2 at a time.
The number of such arrangements is $= \ ^9\text{P}_3$
So, the total of numbers having O at hundred's place $= \ ^9\text{P}_2$
Hence, total number of 3 digit numbers which distinct $= \ ^{10}\text{P}_3 - ^{9}\text{P}_2 $
$=\frac{10!}{(10-3)!}-\frac{9!}{(9-2)!}$
$=\frac{10!}{7!}-\frac{9!}{7!}$
$=\frac{10\times9\times8\times7!}{7!}-\frac{9\times8\times7!}{7!}$
$= 720-72$
$=648$
View full question & answer
Question 592 Marks
How many words can be formed from the letters of the word 'SUNDAY'? How many of these begin with D?
Answer
There are 6 letters in the word 'SUNDAY'. The total number of words formed with these 6 letters is the number of arrangements of 6 items, taken all at a time, which is equal to 6P6 = 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720.
If we fix up Din the beginning, then the remaining 5 letters can be arranged in 5P5 = 5! ways.
so, the total number of words which begin with D = 5! = 5 × 4 × 3 × 2 × 1 = 120.
View full question & answer
Question 602 Marks
How many three-digit numbers are there with no digit repeated?
Answer
We have to form all possible 3 digit numbers with distinct digits.

we cannot have 0 at the hundred's place. so, the hundred's place can be filled with any of the 9 digits 1, 2, 3, 4 .... , 9.

so, there are 9 ways of filling the hundred's place.

Now, 9 digits are left including 0, so, ten's place can be filled with any of the remaining 9 digits in 9 ways. now, the unit's place can be filled which in any of the remaining 8 digits. so, th ere are 8 ways of filling the unit's place.

Hence, the total number of required numbers = 9 × 9 × 8 = 648

View full question & answer
Question 612 Marks
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?
Answer
Clearly the num bar of ways to appoint one principal, one vice-principal and the teacher- incharge is equal to the number of ways to select the three teachers from the 36 teachers.

$\therefore$ Number of ways to appointed 3 teachers = 36 × 35 × 34 = 42840

Hence, the number of ways to appoint one principal, one vice-principal and the teacher-incharge is equal to 42840.

View full question & answer
Question 622 Marks
There are four parcels and five post-offices. In how many different ways can the parcels be sent by registered post?
Answer
Total number of parcels = 4

Total number of post-offices = 5

Since a percel can be sent to any one of the five post offices.

So, the requied number of ways = 5 × 5 × 5 × 5

= 54

= 625

Hence, total number of ways is 625.

View full question & answer
Question 632 Marks
Prove thart.
$\frac{1}{9!}+\frac{1}{10!}+\frac{1}{11!}=\frac{122}{11!}$ 
Answer
 $\text{L.H.S.}= \frac{1}{9!}+\frac{1}{10!}+\frac{1}{11!}$

$=\frac{1}{9!}+\frac{1}{10\times9!}+\frac{1}{11\times10\times9!}$ 

$=\frac{11\times10+11+1}{11\times10\times9!}$

$=\frac{110+11+1}{11!}$

$=\frac{122}{11!}$

$\text{R.H.S.}$

Hence, $\frac{1}{9!}+\frac{1}{10!}+\frac{1}{11!}= \frac{122}{11!}$

View full question & answer
Question 642 Marks
How many different five-digit number licence plates can be made if.
  1. First digit cannot be zero and the repetition of digits is not allowed.
  2. The first-digit cannot be zero, but the repetition of digits is allowed?
Answer
  1. Zero cannot be first digit of the license plates.

This means the first digit can be selected from the 9 digits 1, 2, 3, 4 .... , 9 So, there are 9 ways of filling the first digit of the license plates.

Now, 9 digits are Ieft including 0. So, second place can be filled with any of the remaining 9 digits in 9 ways.

The third place of the license plates can be filled with in any of the remaining 8 digits. So, there are 8 ways of filling the third place.

The fourth place of the license plates can be filled with in any of the remaining 7 digits. So, there are 7 ways at filling the fourth place.

The last place of the license plates can be filled with in any of the remaining 6 digits. So, there are 6 ways of filling the fourth place.

Hence, the total number of ways = 9 × 9 × 8 × 7 × 6 = 27216

  1. Zero cannot be first digit of the license plates.

$\therefore$ First digit can be selected from the 9 digits 1, 2, 3 ..... , 9 So, there are 9 ways at filling the first digit of the licence plates.

The repetition of digits is allowed to made a license plates number.

$\therefore$ The number of ways to fill the remaining places of the number platas = 10 × 10 × 10 × 10.

Hence, the total number of ways = 9 × 10 × 10 × 10 × 10 = 90,000.

View full question & answer
Question 652 Marks
If $^\text{n}\text{P}_4= 360,$ find the value of n.
Answer
We have,

$^\text{n}\text{P}_4= 360,$

$\Rightarrow \frac{\text{n!}}{(\text{n}-4)!}=360$]

$\Rightarrow \frac{\text{n}(\text{n}-1)(\text{n}-2)(\text{n}-3)(\text{n}-4)!=360}{(\text{n}-4)!}$

$\Rightarrow \text{n}(\text{n}-1)(\text{n}-2)(\text{n}-3)=6\times 5\times4\times3 $

$\Rightarrow \text{n}=6 \ [13 \text{ by} \text{ comapring}]$

Hence, $\text{n}=6$

View full question & answer
Question 662 Marks
If (n + 1)! = 90 [(n - 1)!], find n.
Answer
We have,

(n + 1)! = 90 [(n - 1)!]

⇒ (n + 1)! × n × (n - 1)! = 90 [(n - 1)!]

⇒ n (n + 1) = 90

⇒ n2 + 10n - 9n - 90 = 0

⇒ n2 (n + 10) - 9 (n + 10) = 0

⇒ (n- 9) (n + 10) = 0

$\big[\therefore \text{n} +10 \neq 0\big]$

⇒ n - 9 = 0

⇒ n = 9

Hence, n = 9

View full question & answer
Question 672 Marks
How many 3-digit numbers can be formed by using the digits 1 to 9 if no digit is repeated?
Answer
There are 9 ways to pick the 1st digit.
For each of those 9 ways there are 8 ways to choose the second digit. That's 9 × 8 or 72 ways to pick the first two digits.
For each of those 72 ways there are 7 ways to choose the third digit. That's 72 × 7 ways or 504 ways to pick all three digits.
View full question & answer
Question 682 Marks
How many numbers of four digits can be formed with the digits 1, 2, 3, 4, 5 if the digits can be repeated in the same number?
Answer
Total number of digits = 5
Since, the digits can be repeated in the same number.
Total numbers of four digits numbers = 5 × 5 × 5 × 5 = 625
View full question & answer
2 Marks Questions - Page 2 - MATHS STD 11 Science Questions - Vidyadip