Combinatorics with arrangements of the word UNIVERSALLY

Clash Royale CLAN TAG#URR8PPP

up vote
4
down vote

favorite

How many ways are there to arrange the letters in UNIVERSALLY so that the four vowels appear in two cluster of two consecutive letters with at least 2 consonants between the two clusters?

For this, we will look at the compliment of the statement. When doing this we have to look at when their are no consonants in between the cluster of vowels and when there is 1 consnant in between the vowel clusters.

CASE 1: No consonants in between vowel cluster

Since there is no consonant in between the two pair of vowel clusters, we can line up all 4 vowels. We are going to treat UIEA as one letter for right now. We have UIEANVRSLLY. Since UIEA is one letter, we have a total of 8 letters. The ways to arrange this is $cfrac8!2!1!1!1!1!1!1!$. Now lets revisit our vowel cluster. The ways to rearrange UIEA is 4!. Therefore the amount of ways to arrange UNIVERSALLY with no consonants in between vowel cluster is 4! $cfrac8!2!$

CASE 2: 1 consonant in between vowel cluster

This is where I am stuck. The fact that there is 2 L's is confusing me and I do not understand how to proceed

Any help would be appreciated

Thank you!

combinatorics permutations multinomial-coefficients

share|cite|improve this question

edited 3 hours ago

N. F. Taussig

40.9k93253

asked 3 hours ago

Parley

817

add a comment | 

up vote
4
down vote

favorite

How many ways are there to arrange the letters in UNIVERSALLY so that the four vowels appear in two cluster of two consecutive letters with at least 2 consonants between the two clusters?

For this, we will look at the compliment of the statement. When doing this we have to look at when their are no consonants in between the cluster of vowels and when there is 1 consnant in between the vowel clusters.

CASE 1: No consonants in between vowel cluster

Since there is no consonant in between the two pair of vowel clusters, we can line up all 4 vowels. We are going to treat UIEA as one letter for right now. We have UIEANVRSLLY. Since UIEA is one letter, we have a total of 8 letters. The ways to arrange this is $cfrac8!2!1!1!1!1!1!1!$. Now lets revisit our vowel cluster. The ways to rearrange UIEA is 4!. Therefore the amount of ways to arrange UNIVERSALLY with no consonants in between vowel cluster is 4! $cfrac8!2!$

CASE 2: 1 consonant in between vowel cluster

This is where I am stuck. The fact that there is 2 L's is confusing me and I do not understand how to proceed

Any help would be appreciated

Thank you!

combinatorics permutations multinomial-coefficients

share|cite|improve this question

edited 3 hours ago

N. F. Taussig

40.9k93253

asked 3 hours ago

Parley

817

add a comment | 

up vote
4
down vote

favorite

up vote
4
down vote

favorite

How many ways are there to arrange the letters in UNIVERSALLY so that the four vowels appear in two cluster of two consecutive letters with at least 2 consonants between the two clusters?

For this, we will look at the compliment of the statement. When doing this we have to look at when their are no consonants in between the cluster of vowels and when there is 1 consnant in between the vowel clusters.

CASE 1: No consonants in between vowel cluster

Since there is no consonant in between the two pair of vowel clusters, we can line up all 4 vowels. We are going to treat UIEA as one letter for right now. We have UIEANVRSLLY. Since UIEA is one letter, we have a total of 8 letters. The ways to arrange this is $cfrac8!2!1!1!1!1!1!1!$. Now lets revisit our vowel cluster. The ways to rearrange UIEA is 4!. Therefore the amount of ways to arrange UNIVERSALLY with no consonants in between vowel cluster is 4! $cfrac8!2!$

CASE 2: 1 consonant in between vowel cluster

This is where I am stuck. The fact that there is 2 L's is confusing me and I do not understand how to proceed

Any help would be appreciated

Thank you!

combinatorics permutations multinomial-coefficients

share|cite|improve this question

edited 3 hours ago

N. F. Taussig

40.9k93253

asked 3 hours ago

Parley

817

How many ways are there to arrange the letters in UNIVERSALLY so that the four vowels appear in two cluster of two consecutive letters with at least 2 consonants between the two clusters?

For this, we will look at the compliment of the statement. When doing this we have to look at when their are no consonants in between the cluster of vowels and when there is 1 consnant in between the vowel clusters.

CASE 1: No consonants in between vowel cluster

Since there is no consonant in between the two pair of vowel clusters, we can line up all 4 vowels. We are going to treat UIEA as one letter for right now. We have UIEANVRSLLY. Since UIEA is one letter, we have a total of 8 letters. The ways to arrange this is $cfrac8!2!1!1!1!1!1!1!$. Now lets revisit our vowel cluster. The ways to rearrange UIEA is 4!. Therefore the amount of ways to arrange UNIVERSALLY with no consonants in between vowel cluster is 4! $cfrac8!2!$

CASE 2: 1 consonant in between vowel cluster

This is where I am stuck. The fact that there is 2 L's is confusing me and I do not understand how to proceed

Any help would be appreciated

Thank you!

combinatorics permutations multinomial-coefficients

combinatorics permutations multinomial-coefficients

share|cite|improve this question

edited 3 hours ago

N. F. Taussig

40.9k93253

asked 3 hours ago

Parley

817

share|cite|improve this question

edited 3 hours ago

N. F. Taussig

40.9k93253

asked 3 hours ago

Parley

817

share|cite|improve this question

share|cite|improve this question

edited 3 hours ago

N. F. Taussig

40.9k93253

edited 3 hours ago

N. F. Taussig

40.9k93253

edited 3 hours ago

N. F. Taussig

40.9k93253

40.9k93253

asked 3 hours ago

Parley

817

asked 3 hours ago

Parley

817

asked 3 hours ago

Parley

817

817

add a comment | 

add a comment | 

2 Answers
2

active

oldest

votes

up vote
4
down vote



accepted

Y is used as a vowel in the word UNIVERSALLY, but we will ignore that.

You handled the first case correctly.

In how many ways can the letters of the word UNIVERSALLY be arranged so that the vowels appear in exactly two clusters consisting of two vowels apiece with exactly one consonant between the clusters?

Consider two cases, depending on whether or not that letter is L.

The letter between the two clusters of vowels is an L: The four vowels and the L form a block. We have seven objects to arrange, the block and the six distinct consonants N, V, R, S, L, Y. The objects can be arranged in $7!$ ways. Since the L must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are $7!4!$ possible arrangements in this case.

The letter between the two clusters of vowels in not an L: Choose which of the other five consonants lies between the two clusters of two vowels. Then we have seven objects to arrange, the block, two Ls, and the four distinct consonants that do not appear in the block. The objects can be arranged in
$$binom72, 1, 1, 1, 1, 1 = frac7!2!1!1!1!1!1!$$
distinguishable ways. Since the consonant must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are
$$binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in this case.

Hence, there are
$$7!4! + binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in which exactly one consonant appears between two clusters of two vowels.

Can you take if from here?

share|cite|improve this answer

answered 2 hours ago

N. F. Taussig

40.9k93253

• 
  
  
  

  
  

  
  
  
  
  
  

  
  thank you so much!
  – Parley
  1 hour ago
  

  
  
  
  

add a comment | 

up vote
0
down vote

The 7 letters not in the clusters can be arranged on 7!divided by2! ways. The two clusters can straddle any of the 7 letters. CASE2 can occur in 7 times 4! times 7!divided by 2! ways. This answer agrees with the previous one.

share|cite|improve this answer

answered 2 hours ago

judith Khan

23617

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

 

draft saved

draft discarded

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

Name Email

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2949452%2fcombinatorics-with-arrangements-of-the-word-universally%23new-answer', 'question_page');

);

Post as a guest

Name Email

2 Answers
2

active

oldest

votes

2 Answers
2

active

oldest

votes

active

oldest

votes

active

oldest

votes

up vote
4
down vote



accepted

Y is used as a vowel in the word UNIVERSALLY, but we will ignore that.

You handled the first case correctly.

In how many ways can the letters of the word UNIVERSALLY be arranged so that the vowels appear in exactly two clusters consisting of two vowels apiece with exactly one consonant between the clusters?

Consider two cases, depending on whether or not that letter is L.

The letter between the two clusters of vowels is an L: The four vowels and the L form a block. We have seven objects to arrange, the block and the six distinct consonants N, V, R, S, L, Y. The objects can be arranged in $7!$ ways. Since the L must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are $7!4!$ possible arrangements in this case.

The letter between the two clusters of vowels in not an L: Choose which of the other five consonants lies between the two clusters of two vowels. Then we have seven objects to arrange, the block, two Ls, and the four distinct consonants that do not appear in the block. The objects can be arranged in
$$binom72, 1, 1, 1, 1, 1 = frac7!2!1!1!1!1!1!$$
distinguishable ways. Since the consonant must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are
$$binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in this case.

Hence, there are
$$7!4! + binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in which exactly one consonant appears between two clusters of two vowels.

Can you take if from here?

share|cite|improve this answer

answered 2 hours ago

N. F. Taussig

40.9k93253

• 
  
  
  

  
  

  
  
  
  
  
  

  
  thank you so much!
  – Parley
  1 hour ago
  

  
  
  
  

add a comment | 

up vote
4
down vote



accepted

Y is used as a vowel in the word UNIVERSALLY, but we will ignore that.

You handled the first case correctly.

In how many ways can the letters of the word UNIVERSALLY be arranged so that the vowels appear in exactly two clusters consisting of two vowels apiece with exactly one consonant between the clusters?

Consider two cases, depending on whether or not that letter is L.

The letter between the two clusters of vowels is an L: The four vowels and the L form a block. We have seven objects to arrange, the block and the six distinct consonants N, V, R, S, L, Y. The objects can be arranged in $7!$ ways. Since the L must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are $7!4!$ possible arrangements in this case.

The letter between the two clusters of vowels in not an L: Choose which of the other five consonants lies between the two clusters of two vowels. Then we have seven objects to arrange, the block, two Ls, and the four distinct consonants that do not appear in the block. The objects can be arranged in
$$binom72, 1, 1, 1, 1, 1 = frac7!2!1!1!1!1!1!$$
distinguishable ways. Since the consonant must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are
$$binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in this case.

Hence, there are
$$7!4! + binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in which exactly one consonant appears between two clusters of two vowels.

Can you take if from here?

share|cite|improve this answer

answered 2 hours ago

N. F. Taussig

40.9k93253

• 
  
  
  

  
  

  
  
  
  
  
  

  
  thank you so much!
  – Parley
  1 hour ago
  

  
  
  
  

add a comment | 

up vote
4
down vote



accepted

up vote
4
down vote



accepted

Y is used as a vowel in the word UNIVERSALLY, but we will ignore that.

You handled the first case correctly.

In how many ways can the letters of the word UNIVERSALLY be arranged so that the vowels appear in exactly two clusters consisting of two vowels apiece with exactly one consonant between the clusters?

Consider two cases, depending on whether or not that letter is L.

The letter between the two clusters of vowels is an L: The four vowels and the L form a block. We have seven objects to arrange, the block and the six distinct consonants N, V, R, S, L, Y. The objects can be arranged in $7!$ ways. Since the L must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are $7!4!$ possible arrangements in this case.

The letter between the two clusters of vowels in not an L: Choose which of the other five consonants lies between the two clusters of two vowels. Then we have seven objects to arrange, the block, two Ls, and the four distinct consonants that do not appear in the block. The objects can be arranged in
$$binom72, 1, 1, 1, 1, 1 = frac7!2!1!1!1!1!1!$$
distinguishable ways. Since the consonant must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are
$$binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in this case.

Hence, there are
$$7!4! + binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in which exactly one consonant appears between two clusters of two vowels.

Can you take if from here?

share|cite|improve this answer

answered 2 hours ago

N. F. Taussig

40.9k93253

Y is used as a vowel in the word UNIVERSALLY, but we will ignore that.

You handled the first case correctly.

In how many ways can the letters of the word UNIVERSALLY be arranged so that the vowels appear in exactly two clusters consisting of two vowels apiece with exactly one consonant between the clusters?

Consider two cases, depending on whether or not that letter is L.

The letter between the two clusters of vowels is an L: The four vowels and the L form a block. We have seven objects to arrange, the block and the six distinct consonants N, V, R, S, L, Y. The objects can be arranged in $7!$ ways. Since the L must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are $7!4!$ possible arrangements in this case.

The letter between the two clusters of vowels in not an L: Choose which of the other five consonants lies between the two clusters of two vowels. Then we have seven objects to arrange, the block, two Ls, and the four distinct consonants that do not appear in the block. The objects can be arranged in
$$binom72, 1, 1, 1, 1, 1 = frac7!2!1!1!1!1!1!$$
distinguishable ways. Since the consonant must be in the middle of the block, the letters in the block can be arranged in $4!$ ways. Hence, there are
$$binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in this case.

Hence, there are
$$7!4! + binom51binom72, 1, 1, 1, 1, 14!$$
possible arrangements in which exactly one consonant appears between two clusters of two vowels.

Can you take if from here?

share|cite|improve this answer

answered 2 hours ago

N. F. Taussig

40.9k93253

share|cite|improve this answer

share|cite|improve this answer

answered 2 hours ago

N. F. Taussig

40.9k93253

answered 2 hours ago

N. F. Taussig

40.9k93253

answered 2 hours ago

N. F. Taussig

40.9k93253

40.9k93253

• 
  
  
  

  
  

  
  
  
  
  
  

  
  thank you so much!
  – Parley
  1 hour ago
  

  
  
  
  

add a comment | 

• 
  
  
  

  
  

  
  
  
  
  
  

  
  thank you so much!
  – Parley
  1 hour ago
  

  
  
  
  

thank you so much!
– Parley
1 hour ago

thank you so much!
– Parley
1 hour ago

add a comment | 

up vote
0
down vote

The 7 letters not in the clusters can be arranged on 7!divided by2! ways. The two clusters can straddle any of the 7 letters. CASE2 can occur in 7 times 4! times 7!divided by 2! ways. This answer agrees with the previous one.

share|cite|improve this answer

answered 2 hours ago

judith Khan

23617

add a comment | 

up vote
0
down vote

The 7 letters not in the clusters can be arranged on 7!divided by2! ways. The two clusters can straddle any of the 7 letters. CASE2 can occur in 7 times 4! times 7!divided by 2! ways. This answer agrees with the previous one.

share|cite|improve this answer

answered 2 hours ago

judith Khan

23617

add a comment | 

up vote
0
down vote

up vote
0
down vote

The 7 letters not in the clusters can be arranged on 7!divided by2! ways. The two clusters can straddle any of the 7 letters. CASE2 can occur in 7 times 4! times 7!divided by 2! ways. This answer agrees with the previous one.

share|cite|improve this answer

answered 2 hours ago

judith Khan

23617

The 7 letters not in the clusters can be arranged on 7!divided by2! ways. The two clusters can straddle any of the 7 letters. CASE2 can occur in 7 times 4! times 7!divided by 2! ways. This answer agrees with the previous one.

share|cite|improve this answer

answered 2 hours ago

judith Khan

23617

share|cite|improve this answer

share|cite|improve this answer

answered 2 hours ago

judith Khan

23617

answered 2 hours ago

judith Khan

23617

answered 2 hours ago

judith Khan

23617

23617

add a comment | 

add a comment | 

 

draft saved

draft discarded

 

draft saved

draft discarded

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

Name Email

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2949452%2fcombinatorics-with-arrangements-of-the-word-universally%23new-answer', 'question_page');

);

Post as a guest

Name Email

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

Name Email

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

Name Email

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

Post as a guest

Name Email

Name Email

Name

Email

Name Email

Name

Email