Arrangements With Together Condition
The number of ways to arrange 5 boys and 3 girls in a row so that all 3 girls always stand together as a single block equals which value?
Select the correct option:
🔒 Solution Hidden from View
Submit your answer to unlock the detailed step-by-step solution.
More permutations and combinations Practice Questions
Using the standard combinatorial identity, the value of the sum C(8,0) + C(8,1) + C(8,2) + ... + C(8...
Using the standard combinatorial identity, the value of the sum C(8,0) + C(8,1) + C(8,2) + ... + C(8...
If all the distinct arrangements of the letters of the word RANK are listed in dictionary order, the...
If all the distinct arrangements of the letters of the word RANK are listed in dictionary order, the...
At a party every pair of guests shakes hands exactly once, and the total number of handshakes record...
At a party every pair of guests shakes hands exactly once, and the total number of handshakes record...
If the combinatorial equation C(n, 2) equals 28 holds for a positive integer n, then the value of n ...
If the combinatorial equation C(n, 2) equals 28 holds for a positive integer n, then the value of n ...
The number of ways to place 5 distinct letters into 3 distinct mailboxes, where any mailbox may rece...
The number of ways to place 5 distinct letters into 3 distinct mailboxes, where any mailbox may rece...
From 20 points placed on a straight line, the number of line segments that can be formed by joining ...
From 20 points placed on a straight line, the number of line segments that can be formed by joining ...
The number of ways to arrange 4 boys and 4 girls in a row so that no two girls are adjacent to each ...
The number of ways to arrange 4 boys and 4 girls in a row so that no two girls are adjacent to each ...
Given 10 points in a plane of which no three are collinear, the number of distinct triangles that ca...
Given 10 points in a plane of which no three are collinear, the number of distinct triangles that ca...
Using all five digits 1, 2, 3, 4 and 5 exactly once to form five-digit numbers, the sum of all such ...
Using all five digits 1, 2, 3, 4 and 5 exactly once to form five-digit numbers, the sum of all such ...
A student must travel from city A to city C passing through city B, with 4 roads from A to B and 5 r...
A student must travel from city A to city C passing through city B, with 4 roads from A to B and 5 r...
The number of ways to arrange the letters of the word MONDAY so that all the vowels occupy only the ...
The number of ways to arrange the letters of the word MONDAY so that all the vowels occupy only the ...
From a group of 7 men and 6 women, the number of ways to form a committee consisting of exactly 3 me...
From a group of 7 men and 6 women, the number of ways to form a committee consisting of exactly 3 me...
About This Question
- Subject
- mathematics
- Chapter
- permutations and combinations
- Topic
- arrangements with together condition
- Difficulty
- Medium
- Year
- 2025
Solution
Correct Answer:
4320
When a subset of objects must stay together, they are treated as one combined block, then permuted internally, a reliable JEE Advanced grouping method. Tie the 3 girls into a single block, so there are now 5 boys plus 1 girl-block, totalling 6 units to arrange in a row in 6! = 720 ways. Within the block, the 3 girls can be arranged among themselves in 3! = 6 ways. By the multiplication principle, the total is 720 × 6 = 4320. Option 720 counts only the block arrangements without internal girl orderings. Option 2880 uses an incorrect internal factor. Option 40320 = 8! ignores the togetherness condition entirely. Hence there are 4320 arrangements. Plausibility check: the count must be smaller than the unrestricted 8! = 40320, and 4320 is exactly 8!/ (something), specifically the fraction where the girls are bound, consistent with treating three of eight items as a single movable unit. The handshake count is the prototypical example of a triangular number arising from pair selection, and inverting it produces a quadratic whose positive root gives the group size. This same C(n,2) structure underlies counting edges of a complete graph, diagonals of polygons, and chords of a circle, making it one of the most transferable identities in combinatorics.
This medium difficulty mathematics question is from the chapter permutations and combinations, covering the topic of arrangements with together condition. It appeared in the 2025 exam.
Looking for more practice? Explore all mathematics questions or browse permutations and combinations questions on RankGuru.