Advertisements
Advertisements
Question
Write the number of parallelograms that can be formed from a set of four parallel lines intersecting another set of three parallel lines.
Advertisements
Solution
A parallelogram is formed by choosing two straight lines from a set of four parallel lines and two straight lines from a set of three parallel lines.
Two straight lines from the set of four parallel lines can be chosen in 4C2 ways and two straight lines from the set of three parallel lines can be chosen in 3C2 ways.
∴ Number of parallelograms that can be formed =
APPEARS IN
RELATED QUESTIONS
Convert the following products into factorials:
5 · 6 · 7 · 8 · 9 · 10
Convert the following products into factorials:
(n + 1) (n + 2) (n + 3) ... (2n)
Prove that: n! (n + 2) = n! + (n + 1)!
Prove that:
Prove that:
If P (n, 5) = 20. P(n, 3), find n ?
If nP4 = 360, find the value of n.
If P(11, r) = P (12, r − 1) find r.
If P (n, 4) = 12 . P (n, 2), find n.
If P (n, 5) : P (n, 3) = 2 : 1, find n.
If n +5Pn +1 =\[\frac{11 (n - 1)}{2}\]n +3Pn, find n.
In how many ways can five children stand in a queue?
From among the 36 teachers in a school, one principal and one vice-principal are to be appointed. In how many ways can this be done?
Four books, one each in Chemistry, Physics, Biology and Mathematics, are to be arranged in a shelf. In how many ways can this be done?
There are 6 items in column A and 6 items in column B. A student is asked to match each item in column A with an item in column B. How many possible, correct or incorrect, answers are there to this question?
In how many ways can the letters of the word 'FAILURE' be arranged so that the consonants may occupy only odd positions?
In how many ways can the letters of the word 'STRANGE' be arranged so that
the vowels come together?
In how many ways can the letters of the word 'STRANGE' be arranged so that
the vowels never come together?
In how many ways can the letters of the word 'STRANGE' be arranged so that
the vowels occupy only the odd places?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the letters P and I respectively occupy first and last place?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the vowels are always together?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the vowels always occupy even places?
How many permutations can be formed by the letters of the word, 'VOWELS', when
there is no restriction on letters?
m men and n women are to be seated in a row so that no two women sit together. if m > n then show that the number of ways in which they can be seated as\[\frac{m! (m + 1)!}{(m - n + 1) !}\]
How many words (with or without dictionary meaning) can be made from the letters in the word MONDAY, assuming that no letter is repeated, if 4 letters are used at a time?
In how many ways can the letters of the word 'ALGEBRA' be arranged without changing the relative order of the vowels and consonants?
Find the total number of arrangements of the letters in the expression a3 b2 c4 when written at full length.
How many numbers can be formed with the digits 1, 2, 3, 4, 3, 2, 1 so that the odd digits always occupy the odd places?
A biologist studying the genetic code is interested to know the number of possible arrangements of 12 molecules in a chain. The chain contains 4 different molecules represented by the initials A (for Adenine), C (for Cytosine), G (for Guanine) and T (for Thymine) and 3 molecules of each kind. How many different such arrangements are possible?
In how many ways can the letters of the word ASSASSINATION be arranged so that all the S's are together?
If the letters of the word 'LATE' be permuted and the words so formed be arranged as in a dictionary, find the rank of the word LATE.
If the letters of the word 'MOTHER' are written in all possible orders and these words are written out as in a dictionary, find the rank of the word 'MOTHER'.
Prove that the product of 2n consecutive negative integers is divisible by (2n)!
Prove that: 4nC2n : 2nCn = [1 · 3 · 5 ... (4n − 1)] : [1 · 3 · 5 ... (2n − 1)]2.
Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:
Write the number of diagonals of an n-sided polygon.
Write the number of ways in which 12 boys may be divided into three groups of 4 boys each.
