How many ways can 6 items be arranged in 4 boxes with restrictions?

  • Thread starter Thread starter spaghetti3451
  • Start date Start date
  • Tags Tags
    Permutation
Click For Summary
SUMMARY

The discussion focuses on calculating the number of ways to arrange 9 books, including 4 by Shakespeare, 2 by Dickens, and 3 by Conrad, with the restriction that the 3 Conrad books must be separated. The solution involves using permutations, specifically calculating the total arrangements without restrictions (9!) and subtracting the arrangements where the Conrad books are clustered together (3! * 7!). The final answer, confirmed by the textbook, is 151,200 arrangements.

PREREQUISITES
  • Understanding of permutations and combinations
  • Familiarity with factorial notation
  • Knowledge of clustering concepts in combinatorial problems
  • Basic problem-solving skills in discrete mathematics
NEXT STEPS
  • Study advanced permutation techniques in combinatorics
  • Learn about restrictions in arrangements and their impact on outcomes
  • Explore clustering methods in combinatorial problems
  • Practice similar problems involving arrangements with restrictions
USEFUL FOR

Students in mathematics, particularly those studying combinatorics, educators teaching discrete mathematics, and anyone interested in solving complex arrangement problems.

spaghetti3451
Messages
1,311
Reaction score
31

Homework Statement



4 books by Shakespeare, 2 books are Dickens and 3 by Conrad are chosen for the problem. The question is to find the number of ways in which the books can be arranged s.t. the 3 Conrad books are separated.

Homework Equations



The Attempt at a Solution



n(C separated) = n(w/o any restrictions) - n(3 C's together) - n(2 C's together).

n(w/o any restrictions) = 9! because there are 9 items to be put in 9 places.

n(3 C's together) = 3! * 7! because the 3 C's form a cluster: 3! for items within the cluster and 7! for all the items, considering the cluster as an item.

n(2 C's together) = ... This is the tricky one as only 2 C's form a cluster and the number of places available for the other C depends on whether the cluster is at either of the edges of not.


The answer is supposed to be 151,200 (from the back of the textbook), but I can't happen to get it.
 
Physics news on Phys.org
hi failexam! :smile:
failexam said:
n(3 C's together) = 3! * 7! because the 3 C's form a cluster: 3! for items within the cluster and 7! for all the items, considering the cluster as an item.

good! :smile:

but probably easier to start again, this way …

the three conrad books have 4 "boxes" between and around them …

how many ways to fit 6 items into 4 boxes, with only the outside boxes allowed to be empty?
 
tiny-tim said:
The three conrad books have 4 "boxes" between and around them … how many ways to fit 6 items into 4 boxes, with only the outside boxes allowed to be empty?
Note the middle 2 boxes have to have at least 1 book each, so that leaves the remaining 4 books to be placed in the 4 boxes in any pattern.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
Replies
7
Views
7K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K
Replies
3
Views
2K
  • · Replies 16 ·
Replies
16
Views
7K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 28 ·
Replies
28
Views
3K
Replies
1
Views
2K