Undergrad Permutation of identical elements

Click For Summary
The discussion centers on finding a general formula for the permutation of n objects, where some elements are identical. It suggests using binomial coefficients to calculate the arrangements, focusing on one factor for each set of identical elements. The example provided illustrates that there are (5 choose 3) or (5 choose 2) different permutations for the sequence (1,1,1,2,2). The last factor in the calculation is considered to be 1 and can be disregarded. This method effectively addresses the challenge of counting permutations with identical items.
rajeshmarndi
Messages
319
Reaction score
0
If we have n object and n1,n2,..nk are identical element. And we take r at a time i.e r < n. Is there a general formulae for the permutation of the above. Or how it is solved? Thanks.
 
Mathematics news on Phys.org
Use the binomial coefficients to find the ways to arrange the identical element - one factor per set of identical elements. The last factor is 1 and can be ignored.

As an example, there are (5 choose 3)=(5 choose 2) different permutations of (1,1,1,2,2).
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
1
Views
3K
Replies
17
Views
3K
Replies
1
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
3
Views
3K
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K