Arrangements with Conditions: JEE Main Maths Questions
Reviewed Last updated 2026-11-20. Syllabus topic: Arrangements with conditions and simple applications.
In short. For conditional arrangements, treat objects that must stay together as one block, place objects that must stay apart into the gaps of the others, and for selection followed by arrangement multiply C(n, r) by the number of orderings.
- Together: glue the objects into a block, arrange the blocks, then multiply by the arrangements inside the block.
- Not together: total arrangements minus the together case, or arrange the others first and place the restricted objects in the gaps.
- With k objects in the gaps of m others there are m + 1 gaps, giving P(m + 1, k) placements of k different objects.
- A fixed relative order of two objects (A left of B) is exactly half of all arrangements.
- Select-then-arrange: choose with C(n, r), then multiply by the number of arrangements of the chosen objects.
Syllabus line: PERMUTATIONS AND COMBINATIONS: The fundamental principle of counting, permutations and combinations; Meaning of P(n, r) and C(n, r). Simple applications. (NTA JEE (Main) 2026 syllabus, Mathematics, Unit 4 (https://jeemain.nta.nic.in/document/syllabus-2026/))
Before you start
Prerequisites
- Fundamental principle of counting and permutations: Blocks, gaps and positions are all counted with the multiplication principle and P(n, r). Read this first if n! and P(n, r) are not automatic.
- Combinations and selections: Select-then-arrange problems and the pairs counted in handshake and match problems use C(n, r). Read this first if C(n, 2) and the complement method are not familiar.
Related topics
- Fundamental principle of counting and permutations
- Combinations and selections
- Statistics and Probability (lesson planned)
- Binomial Theorem (lesson planned)
The concept step by step
Step 1: Start from the plain arrangement count
With n different objects in a row there are n! arrangements. Every condition in this lesson removes some of these arrangements or counts a special subset of them. Before applying any device, write down the unrestricted count n! so that you can compare your final answer with it; for arrangements of the same n objects, a conditional answer can never be larger.
Step 2: Objects that must be together
If some objects must stand side by side, glue them into one block. Arrange the block with the other objects, then multiply by the ways to arrange inside the block. For 5 people with 3 particular people together, we have 3 objects, 3! ways, and 3! ways inside the block, so 36. If the glued letters are identical, such as OO, no inside factor is needed.
Step 3: Objects that must not be together
Two methods work. Either take all arrangements and subtract the together case, or place the unrestricted objects first and drop the restricted ones into the gaps. m objects in a row make m + 1 gaps, including both ends. For 4 boys and 3 girls with no two girls adjacent, 4! x P(5, 3) = 24 x 60 = 1440.
Step 4: Fixed positions and a fixed order
A person who must stand at one of two ends gives a factor 2, after which the others fill the rest freely. If A must be to the left of B (not necessarily adjacent), swapping A and B pairs each arrangement with one of the opposite order, so exactly half of the arrangements qualify. Apply the half once and only when the other conditions treat A and B alike.
Step 5: Select first, then arrange
Some problems pick objects and then place them. Count the selection with C(n, r), then multiply by the number of valid arrangements of the chosen objects. For 3 men from 5 and 2 women from 4 seated with no two women together: 10 x 6 selections, then 3! x P(4, 2) seatings, giving 60 x 72 = 4320. Remember C(n, r) x r! = P(n, r).
Step 6: Simple applications counted as pairs
Handshakes, matches in a league where every pair meets once, and the number of lines joining n points all count unordered pairs, which is C(n, 2) = n(n - 1)/2. If the direction matters, such as each person sending one message to each other person, the count is P(n, 2) = n(n - 1). Decide whether the pair has an order before choosing the formula.
Worked examples
Each solution shows the marks every step would earn. The sanity check tests units and size of the answer.
Example 1 (easy)
In how many ways can 5 people stand in a row so that 3 particular people are always together?
| Step | Marks |
|---|---|
| Glue the 3 particular people into one block; with the other 2 people this makes 3 objects. | 1 |
| Arrange the 3 objects: 3! = 6 ways; arrange the people inside the block: 3! = 6 ways. | 2 |
| Total = 6 x 6 = 36. | 1 |
| Total: 4 marks | 4 |
Answer: 36
Fast method: (5 - 3 + 1)! x 3! = 3! x 3!.
Sanity check: The count must be below 5! = 120; 36 is 30 percent of 120, plausible for a tight condition on 3 of 5 people.
Example 2 (easy)
At a meeting each of 12 people shakes hands once with every other person. How many handshakes take place?
| Step | Marks |
|---|---|
| A handshake is an unordered pair of people, so order does not matter. | 1 |
| Number of pairs = C(12, 2) = 12 x 11/2. | 1 |
| Handshakes = 66. | 1 |
| Total: 3 marks | 3 |
Answer: 66
Fast method: n(n - 1)/2 = 12 x 11/2 = 66.
Sanity check: Each person shakes 11 hands, so 12 x 11 = 132 hand-ends; each handshake uses 2 hands, so 132/2 = 66.
Example 3 (medium)
In how many ways can 4 boys and 3 girls stand in a row so that no two girls are next to each other?
| Step | Marks |
|---|---|
| Arrange the 4 boys first: 4! = 24 ways. | 1 |
| The boys create 5 gaps (3 between them and 2 at the ends). | 1 |
| Place the 3 girls in 3 different gaps, in order: P(5, 3) = 60 ways. | 2 |
| Total = 24 x 60 = 1440. | 1 |
| Total: 5 marks | 5 |
Answer: 1440
Fast method: 4! x P(5, 3) = 24 x 60.
Sanity check: It must be below 7! = 5040; 1440/5040 = 2/7, and the chance that no two of 3 girls are adjacent being about 2/7 is reasonable.
Example 4 (medium)
In how many different ways can the letters of the word SCHOOL be arranged so that the two Os are always together?
| Step | Marks |
|---|---|
| Glue the two Os into one block OO; with S, C, H and L this gives 5 different objects. | 1 |
| Arrange the 5 objects: 5! = 120 ways. | 1 |
| The two Os are identical, so there is no internal arrangement factor; the count is 120. | 2 |
| Total: 4 marks | 4 |
Answer: 120
Fast method: 5! with no extra factor, because OO looks the same either way.
Sanity check: All arrangements of SCHOOL number 6!/2! = 360; having the Os adjacent should be a minority, and 120 is exactly one third of 360, which matches the position count: the two Os occupy 2 of 6 places in 15 ways and 5 of these pairs are adjacent, so 5/15 = 1/3.
Example 5 (hard, multi-step)
From 5 men and 4 women, 3 men and 2 women are chosen and seated in a row so that no two women sit together. In how many ways can this be done?
| Step | Marks |
|---|---|
| Select the people: C(5, 3) x C(4, 2) = 10 x 6 = 60 groups. | 1 |
| Seat the 3 men in a row: 3! = 6 ways. They leave 4 gaps. | 1 |
| Seat the 2 women in different gaps, in order: P(4, 2) = 12 ways. | 2 |
| Total = 60 x 6 x 12 = 4320. | 2 |
| Total: 6 marks | 6 |
Answer: 4320
Fast method: C(5, 3) x C(4, 2) x 3! x P(4, 2) = 60 x 6 x 12.
Sanity check: Without the condition the 5 chosen people can sit in 5! = 120 ways, so at most 60 x 120 = 7200; the gap condition keeps 72 of 120, i.e. 60 percent, giving 4320.
Example 6 (hard, multi-step)
Six people P1, P2, P3, P4, P5 and P6 stand in a row so that P3 is at one of the two ends and P1 is somewhere to the left of P2. In how many ways can this be done?
| Step | Marks |
|---|---|
| P3 can take either end: 2 ways. | 1 |
| The other 5 people fill the remaining 5 places in 5! = 120 ways. | 1 |
| By symmetry in P1 and P2, exactly half of these have P1 to the left of P2: 120/2 = 60. | 2 |
| Total = 2 x 60 = 120. | 1 |
| Total: 5 marks | 5 |
Answer: 120
Fast method: 2 x 5!/2 = 120.
Sanity check: Unrestricted there are 720 arrangements; the end condition keeps 2/6 = 1/3 and the order condition keeps 1/2, so 720/6 = 120.
Formulas and units
| Result | Formula | Valid when | Units or note | Worked example |
|---|---|---|---|---|
| Together (block) | k objects together among n: (n - k + 1)! x k! | n distinct objects, k specified ones kept together | dimensionless | Example 1 |
| Not together | n! minus the together count | n distinct objects; subtract the together count from n! | dimensionless | none |
| Gap method | m others make m + 1 gaps; k different objects apart: m! x P(m + 1, k) | m others placed first; k different objects in separate gaps | dimensionless | Example 3 |
| Fixed order of two objects | half of all arrangements: n!/2 | two distinct objects in a set order, no other condition on them | dimensionless | Example 6 |
| Select then arrange | C(n, r) x r! = P(n, r) | r objects chosen from n distinct and then arranged | dimensionless | none |
| Identical letters | n!/(p! q!) for p and q copies of two letters | p and q identical copies; all other letters different | dimensionless | none |
| Pairs, handshakes, matches | C(n, 2) = n(n - 1)/2 | unordered pairs from n distinct people or teams | dimensionless | Example 2 |
| Ordered pairs of people | P(n, 2) = n(n - 1) | ordered pairs from n distinct people (order matters) | dimensionless | none |
| Block of identical letters | no internal factor (OO together in SCHOOL: 5!) | two identical letters glued as one block | dimensionless | Example 4 |
Common mistakes and speed
- Multiplying by 2! for the inside order of a block of identical letters, such as OO. Why it tempts: Blocks of different people always carry an internal factor, so the habit continues where the letters are the same.
- Forgetting the end gaps in the gap method, using m gaps instead of m + 1. Why it tempts: People think of "between" the others only, so the two ends are not counted.
- Subtracting only one together case, or confusing "not together" with "separated by exactly one person". Why it tempts: The words suggest a simple subtraction, but the together case has its own internal factor.
- Using the halving rule when another condition is not symmetric in the two objects. Why it tempts: A fixed order of two objects looks like a clean division by 2, but a condition that treats one of them specially breaks the symmetry.
- Using P(n, 2) for handshakes or matches, which counts each pair twice. Why it tempts: Counting person by person feels like counting ordered choices, and n(n - 1) is a neat number.
Time per question and fast method
Target: about 100 seconds per question.
Read the condition and pick the device before calculating: block for together, gaps for apart, half for a fixed order of two, C(n, r) then arrangement for select-then-arrange. If two conditions interact, split into cases and add. Check the answer against the unrestricted n!.
Recall quiz
Pick an option for each question. Your answers stay on this page and are not sent anywhere.
Score: 0 of 5 correct. Pick an option for each question.
Practice
- In how many ways can the letters of the word EQUATION be arranged so that all the vowels come together? Verified (T1)
- Six people A, B, C, D, E and F stand in a row. Find the number of arrangements in which A and B are not next… Verified (T3)
- In how many ways can 5 different books be arranged on a shelf so that two particular books are always next to… Verified (T1)
- In how many ways can the letters of the word TRIANGLE be arranged so that no two vowels are next to each… Verified (T1)
Previous-year questions
Previous-year questions are not imported yet. Previous-year questions are not imported yet; see the official papers on the NTA site. Official NTA papers page.
Going deeper and revision
Objects that must be together: the block method
If a set of objects must stand next to each other, treat them as one object (a block). Arrange the blocks and the remaining objects as usual, then multiply by the number of ways to arrange the objects inside the block. For 7 people in a row with 3 particular people always together, the block and 4 others make 5 objects, giving 5! arrangements, and the three can be ordered inside the block in 3! ways, so 5! x 3! = 720. If a group must be together but its internal order is fixed (for example two letters that must appear as "OO"), do not multiply inside. For identical objects such as two Os together, the internal factor is 1, not 2!. The method counts arrangements where the group is adjacent in a row, not in a circle; circular arrangements are not part of this lesson.
Objects that must not be together: complement and gap method
There are two reliable methods. The complement method counts all arrangements and subtracts those in which the objects are together; it suits two or three restricted objects. The gap method suits a larger restricted group: arrange the unrestricted objects first, which creates one gap before, between and after them (m objects make m + 1 gaps), then place the restricted objects at most one per gap, choosing and ordering gaps in P(m + 1, k) ways for k different objects. For 4 boys and 3 girls with no two girls together, the boys arrange in 4! ways, make 5 gaps, and the girls fill 3 of them in P(5, 3) = 60 ways, so 24 x 60 = 1440. Do not forget the end gaps; they are the most common omission. Both methods must agree, and checking one against the other is a good way to catch errors.
Position conditions, fixed order and select-then-arrange
For a person who must occupy a particular place, put that person in first and arrange the rest; for a person who must occupy one of two end places, multiply by 2. If two specified objects must appear in a given relative order (A somewhere to the left of B) then, by symmetry, exactly half of all arrangements satisfy it, because swapping A and B pairs every arrangement with one of the opposite order; this halving is valid even when other conditions are present as long as they are symmetric in A and B. When objects are chosen and then arranged, count the selection with C(n, r) and multiply by the arrangements of the chosen objects: choosing 3 men and 2 women and then seating them in a row is C(m, 3) x C(w, 2) x (arrangements of the 5). Letter problems use the same ideas, with vowels and consonants as the two types and identical letters dividing by their factorials.
Simple applications, edge cases and what examiners test
Handshakes, matches in a round-robin tournament where each pair meets once, and the number of lines or diagonals are all counts of pairs, so use C(n, 2); if order or direction matters (each of n people sends a message to every other person) the count is P(n, 2). Typical JEE Main items combine one of these conditions with a word or a row of people: vowels together, vowels apart, two people not adjacent, a fixed person at an end. The edge cases are: identical letters (divide by the repeat factorials), a block containing identical letters (no internal factor), the end gaps in the gap method, and conditions that interact (for example one person at an end and another not adjacent to that person), which need a case split. Circular arrangements, derangements and inclusion-exclusion theory lie outside this lesson. Always check that the answer is a whole number not exceeding the unrestricted count n!.
Memory hook
Suppose six friends line up for a photo on a college stage, and two of them, Ravi and Meena, insist on standing side by side.
- Treat Ravi and Meena as one pair standing together. Now there are 5 things to line up: the pair and the other 4 friends, in 5! = 120 ways.
- Inside the pair, Ravi can be on the left or on the right: 2 ways. So the photo can be arranged in 120 x 2 = 240 ways.
- Now ignore the Ravi and Meena condition and ask only that Sunil and Priya must not stand side by side. Line up the other 4 friends first in 4! = 24 ways; that leaves 5 gaps, and Sunil and Priya take two different gaps in 5 x 4 = 20 ways, so 24 x 20 = 480 photos.
Together means glue into a block and multiply by its internal orders; apart means arrange the others first and drop the restricted people into the gaps.
Together: glue it. Apart: use the gaps, and do not forget the two ends.
Revision card
Try to answer each without looking above.
- How do you count arrangements with a group of k objects always together?
- How do you count arrangements with no two of the restricted objects together, and how many gaps do m objects make?
- What fraction of arrangements has A to the left of B, and why?
- How do you count a select-then-arrange problem?
- Why is a block of two identical letters not multiplied by 2!?
- When do you use C(n, 2) and when P(n, 2) in handshake and message problems?
Sources and review
Reviewed Reviewed on 2026-11-20: every number recomputed by code and independently reviewed; textbook section references pending.
- Method: Every number in worked examples, recall checks and notes recomputed by code; claims recomputed independently by a separate verifier run using other numerical methods; textbook section references not yet attached; wording defects found were fixed afterwards and re-linted (code checks re-run) but not re-reviewed by a second run; syllabus scope compared with the NTA JEE Main 2026 syllabus text (see content/reviews/scope-audit-2026-11-20.md)
- Reviewer: independent verifier agent run (not the author)
- Date: 2026-11-20
- Defects found: 2; fixed: 2
- Report: content/reviews/learn2-pnc-2026-11-20.md
Textbook references
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.4 Combinations (read 2026-11-22)
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, Example 14 Permutations (worked example, DAUGHTER) (read 2026-11-22)
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, Miscellaneous Examples Example 20 (read 2026-11-22)
Sources used
- Syllabus: NTA JEE (Main) 2026 syllabus, Mathematics, Unit 4 (https://jeemain.nta.nic.in/document/syllabus-2026/), text copied from the repository syllabus line file
- NCERT Class 11 Mathematics, chapter on Permutations and Combinations: scope reference only, not opened for this draft; content written fresh and textbook section references are pending
How labels work: see how answers and lessons are verified. Found a mistake? Use Report an error on any question page.