Permutation of n ,not all different things, taking r at a time
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Please read it once again, it's not as easy as it seems.
Is there any Mathematical formula or finite approach to solve this type of problem.
Eg - Find the permutation of word "MALAYALAM" taking 5 at a time.
I have written a program which can solve this type of problem ,but I couldn't found any method to do it on paper.
My programming approach -
(i) Find all the combination taking r at a time
(ii) Remove duplicates from combination by sorting
(iii) Find the permutation of individual combination and then sum up, to get the answer.
Please help me,
Thanks
permutations
add a comment |Â
up vote
1
down vote
favorite
Please read it once again, it's not as easy as it seems.
Is there any Mathematical formula or finite approach to solve this type of problem.
Eg - Find the permutation of word "MALAYALAM" taking 5 at a time.
I have written a program which can solve this type of problem ,but I couldn't found any method to do it on paper.
My programming approach -
(i) Find all the combination taking r at a time
(ii) Remove duplicates from combination by sorting
(iii) Find the permutation of individual combination and then sum up, to get the answer.
Please help me,
Thanks
permutations
Possible duplicate of Number of ways of forming 4 letter words using the letters of the word RAMANA
â user190080
Jul 15 at 13:39
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Please read it once again, it's not as easy as it seems.
Is there any Mathematical formula or finite approach to solve this type of problem.
Eg - Find the permutation of word "MALAYALAM" taking 5 at a time.
I have written a program which can solve this type of problem ,but I couldn't found any method to do it on paper.
My programming approach -
(i) Find all the combination taking r at a time
(ii) Remove duplicates from combination by sorting
(iii) Find the permutation of individual combination and then sum up, to get the answer.
Please help me,
Thanks
permutations
Please read it once again, it's not as easy as it seems.
Is there any Mathematical formula or finite approach to solve this type of problem.
Eg - Find the permutation of word "MALAYALAM" taking 5 at a time.
I have written a program which can solve this type of problem ,but I couldn't found any method to do it on paper.
My programming approach -
(i) Find all the combination taking r at a time
(ii) Remove duplicates from combination by sorting
(iii) Find the permutation of individual combination and then sum up, to get the answer.
Please help me,
Thanks
permutations
asked Jul 15 at 4:42
RAHUL JAISWAL
83
83
Possible duplicate of Number of ways of forming 4 letter words using the letters of the word RAMANA
â user190080
Jul 15 at 13:39
add a comment |Â
Possible duplicate of Number of ways of forming 4 letter words using the letters of the word RAMANA
â user190080
Jul 15 at 13:39
Possible duplicate of Number of ways of forming 4 letter words using the letters of the word RAMANA
â user190080
Jul 15 at 13:39
Possible duplicate of Number of ways of forming 4 letter words using the letters of the word RAMANA
â user190080
Jul 15 at 13:39
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
0
down vote
accepted
Yes, there is a formula.
The word has one Y, two each of M and L and four of A
and the formula would be to find the coefficient of $x^5$ in $5!(1+fracx1!)(1+fracx1!+fracx^22!)^2 (1+fracx1! + fracx^22! + fracx^33! + fracx^44!)$
To understand why this works, you can see here
Thanks frnd ,I got it
â RAHUL JAISWAL
Jul 15 at 14:51
You're welcome !
â true blue anil
Jul 15 at 19:07
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
Yes, there is a formula.
The word has one Y, two each of M and L and four of A
and the formula would be to find the coefficient of $x^5$ in $5!(1+fracx1!)(1+fracx1!+fracx^22!)^2 (1+fracx1! + fracx^22! + fracx^33! + fracx^44!)$
To understand why this works, you can see here
Thanks frnd ,I got it
â RAHUL JAISWAL
Jul 15 at 14:51
You're welcome !
â true blue anil
Jul 15 at 19:07
add a comment |Â
up vote
0
down vote
accepted
Yes, there is a formula.
The word has one Y, two each of M and L and four of A
and the formula would be to find the coefficient of $x^5$ in $5!(1+fracx1!)(1+fracx1!+fracx^22!)^2 (1+fracx1! + fracx^22! + fracx^33! + fracx^44!)$
To understand why this works, you can see here
Thanks frnd ,I got it
â RAHUL JAISWAL
Jul 15 at 14:51
You're welcome !
â true blue anil
Jul 15 at 19:07
add a comment |Â
up vote
0
down vote
accepted
up vote
0
down vote
accepted
Yes, there is a formula.
The word has one Y, two each of M and L and four of A
and the formula would be to find the coefficient of $x^5$ in $5!(1+fracx1!)(1+fracx1!+fracx^22!)^2 (1+fracx1! + fracx^22! + fracx^33! + fracx^44!)$
To understand why this works, you can see here
Yes, there is a formula.
The word has one Y, two each of M and L and four of A
and the formula would be to find the coefficient of $x^5$ in $5!(1+fracx1!)(1+fracx1!+fracx^22!)^2 (1+fracx1! + fracx^22! + fracx^33! + fracx^44!)$
To understand why this works, you can see here
edited Jul 15 at 7:43
answered Jul 15 at 7:26
true blue anil
20.3k11841
20.3k11841
Thanks frnd ,I got it
â RAHUL JAISWAL
Jul 15 at 14:51
You're welcome !
â true blue anil
Jul 15 at 19:07
add a comment |Â
Thanks frnd ,I got it
â RAHUL JAISWAL
Jul 15 at 14:51
You're welcome !
â true blue anil
Jul 15 at 19:07
Thanks frnd ,I got it
â RAHUL JAISWAL
Jul 15 at 14:51
Thanks frnd ,I got it
â RAHUL JAISWAL
Jul 15 at 14:51
You're welcome !
â true blue anil
Jul 15 at 19:07
You're welcome !
â true blue anil
Jul 15 at 19:07
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2852193%2fpermutation-of-n-not-all-different-things-taking-r-at-a-time%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Possible duplicate of Number of ways of forming 4 letter words using the letters of the word RAMANA
â user190080
Jul 15 at 13:39