1.
From city A to B there are 3 different roads. From B to C there are 5. From C to D there are 2. Laxman has to go from city A to D attending some work in city B and C on the way and has to come back in the reverse order. In hi many ways can he complete his journey if he has to take a different while coming back than he did while going?
2.
Neetu has five identical beads each of nine different colours. She wants to make a necklace such that the beads of the same colour always come together. How many different arrangements can she have?
3.
One white square is chosen at random. In how many ways can a black square be chosen such that it does not lie in the same row as the white square?
4.
How many necklaces can be made using at least 5 from 8 beads of different colours?
5.
Find the possible values of n if 30 P(n,6) = P(n+2f7).
6.
Using all the prime numbers less than 10 how many four-digit even numbers can be made if repetition is not allowed?
7.
There are 15 points in a plane, out of which 6 are collinear. How many pentagons can be drawn with these points?
8.
If P(n-1,3):P(n,3) = 1:9, find n.
9.
How many four-digit numbers are there with distinct digits?