Number of ways of arranging 5 different objects in the squares of given figure in such a way that no row remains empty and one square can't have more then one object.
Row No. | Case 1 | case 2 | case 3 | case 4 |
1st | 3 | 2 | 2 | 1 |
2nd | 1 | 2 | 1 | 2 |
3rd | 1 | 1 | 2 | 2 |
No. of ways for each case | (4C3 2C1 2C1)×5! =16×5! |
(4C2 2C2 2C1)×5! =12×5! |
(4C2 2C1 2C2)×5! =12×5! |
(4C1 2C2 2C2)×5! =4×5! |