Skip to content
Exercise 6.3 · Q11

Q.In how many ways can 5 Mathematics, 4 English and 3 Accountancy books can be arranged in a shelf if

(i) all books on the same subject are together
(ii) No two books on the same subject are together
Sikkim CbseNCERTSubjective· 3mImportance★★★★★est
40% · 51/126 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

(i) uses the block (grouping) method;

(ii) requires classifying all English-Accountancy letter-patterns by their internal same-letter-adjacent count, then inserting the 5 distinct Maths books into the gaps so no Maths sits beside another Maths — a generalisation of the simple gap method to three groups.

Grouping method: tie a "must stay together" set into one block, arrange blocks, then arrange within each block (k!k! for a block of kk distinct items). Gap method: after fixing a base sequence of nn letters, there are n+1n+1 gaps (including both ends) available to insert further items so that no two inserted items are adjacent to each other.

(i) All books on the same subject together

  1. Tie the 5 Maths books into one block, the 4 English into one block, the 3 Accountancy into one block — 3 blocks total.
  2. Arrange the 3 blocks on the shelf: 3!=63!=6 ways.
  3. Arrange the 5 distinct Maths books within their block: 5!=1205!=120.
  4. Arrange the 4 distinct English books within their block: 4!=244!=24.
  5. Arrange the 3 distinct Accountancy books within their block: 3!=63!=6.
  6. Total =3!×5!×4!×3!=6×120×24×6=3!\times5!\times4!\times3! = 6\times120\times24\times6.
  7. Compute: 6×120=7206\times120=720; 720×24=17280720\times24=17280; 17280×6=10368017280\times6=103680.

(ii) No two books on the same subject are adjacent

  1. First arrange only the type-pattern of the 4 English (E) and 3 Accountancy (A) letters in a row of 7 slots — there are (73)=35\binom{7}{3}=35 such letter-patterns in total (choosing which 3 of the 7 slots are A).
  2. For a pattern broken into rr maximal "runs" of the same letter (e.g. EEE-A-E-AA has run-lengths 3,1,1,23,1,1,2, so r=4r=4 runs), the number of already-adjacent same-letter pairs is k=7−rk=7-r (a run of length LL contributes L−1L-1 same-letter-adjacent pairs, summing to 7−r7-r over the whole row).
  3. Grouping the 35 E/A patterns by their run-count rr (equivalently by k=7−rk=7-r) gives: k=0k=0: 1 pattern, k=1k=1: 6 patterns, k=2k=2: 9 patterns, k=3k=3: 12 patterns, k=4k=4: 5 patterns, k=5k=5: 2 patterns (these add to 1+6+9+12+5+2=351+6+9+12+5+2=35 ✓). …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.