Permutations with repeating elements

This topic has expert replies
Newbie | Next Rank: 10 Posts
Posts: 5
Joined: Wed Mar 24, 2010 6:07 pm

Permutations with repeating elements

by ttd » Sat Apr 03, 2010 12:51 pm
Hello,

I am aware that the formula for general permutations is:
Perm = N! / (N - K)!

And for permutations with repeating elements is:
Perm = N! / R!
(where R = number of repeating elements)

Now, would anyone be able to / willing to give a brief explanation of how the two are related?
I was already told by Veritas support to "just memorize both", but I'm the kind of person who remembers things better by understanding. So unless it's the kind of explanation only mathematicians would understand, I was hoping to get a little insight!

So please help ~ thanks ~

User avatar
Legendary Member
Posts: 1560
Joined: Tue Nov 17, 2009 2:38 am
Thanked: 137 times
Followed by:5 members

by thephoenix » Sat Apr 03, 2010 7:51 pm
the rules are
1)# of permutation(or arrangements) of n diff things taken k at a time=nPk=n!/(n-k)!
2)# of permutation(or arrangements) of n diff things taken all at a time=nPn=n!
3)# of permutation(or arrangements) of n things out of which P1 are alike and are of one type , p2 are alike and are of one type is given by n!/(p1!*p2!)

ex:
find the # of permutation of 6things taken 4 at a time
=6P4
find the # of words formed with the letters of the word allahabad
tot # of letters=9 of which A occurs 4 times L occurs 2 times and rest are diff
so # of arrangements=9!/(4!*2!)

User avatar
Master | Next Rank: 500 Posts
Posts: 435
Joined: Mon Mar 15, 2010 6:15 am
Thanked: 32 times
Followed by:1 members

by eaakbari » Sat Apr 03, 2010 10:40 pm
Since we are on this topic. Do check this link by harsha out

https://www.beatthegmat.com/method-to-fi ... 55506.html

User avatar
Community Manager
Posts: 1537
Joined: Mon Aug 10, 2009 6:10 pm
Thanked: 653 times
Followed by:252 members

by papgust » Sat Apr 03, 2010 11:07 pm
Moving to GMAT Math!

User avatar
Legendary Member
Posts: 2131
Joined: Mon Feb 03, 2014 9:26 am
Location: https://martymurraycoaching.com/
Thanked: 955 times
Followed by:140 members
GMAT Score:800

by MartyMurray » Sun Nov 23, 2014 4:51 am
The basic idea is that the order of the repeating elements does not matter. So there will be fewer different permutations when elements repeat. So how many fewer?

Well, look at it this way. Any subset of elements creates a permutation within a permutation.

For instance, if we look at two elements within a permutation, A and B, they can either go A B or B A. Now if we make them both A, there is only one permutation A A. So any permutation that includes this repeating element will only have half the different permutations that it would if the repeating element were two different elements. So to find the actual number of different permutations, we would divide by two to account for the fact that either of the two orders of these elements is the same.

For example, where ordinarily a permutation of six elements used six times creates 6! different lineups, if two of the elements are the same, then all the permutations where one of those repeated elements comes before the other are the same as those where that element comes after the other. So there are only half the number of different permutations and the calculation becomes 6!/2.

If there are more than two elements that are the same, we need to figure out how many permutations within the permutation are actually the same. This is pretty simple. Just figure out how many permutations of the repeating elements there would be if the repeating elements were actually different. So if there is an element that shows up three times, that element would perm 3! = 6, but actually all six are the same. So in a permutation with three same elements we divide the basic permutation by 3! to get the actual number of different lineups. For example, in a permutation of 8 elements used 8 times, the formula would be 8!, but if three of the elements are the same, then 3! permutations within the permutations are the same. So we need to divide, 8!/3!, to get the actual number of different permutations.

This can obviously be applied to account for any number of repeating elements, and of there are multiple repeating elements, you just do it for each set.

So in a permutation of 8 elements, where two are the same as each other and another three are the same as each other, you start with the 8!. Then divide to account for the permutations within the permutation that are actually all the same. So it's 8!/2!3!.

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pm
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1268 members
GMAT Score:770

by Brent@GMATPrepNow » Sun Nov 23, 2014 8:37 am
When we want to arrange a group of items in which some of the items are identical, we can use something called the MISSISSIPPI rule. It goes like this:

If there are n objects where A of them are alike, another B of them are alike, another C of them are alike, and so on, then the total number of possible arrangements = n!/[(A!)(B!)(C!)....]

So, for example, we can calculate the number of arrangements of the letters in MISSISSIPPI as follows:
There are 11 letters in total
There are 4 identical I's
There are 4 identical S's
There are 2 identical P's
So, the total number of possible arrangements = 11!/[(4!)(4!)(2!)]

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image