# How many arrangements are possible with the letters of the word profile if no two consonants are to come together?

Hi all,

I would appreciate any feedback on my solution to this problem.

Problem:

How many arrangements of the word DAUGHTER are there if none of the vowels can ever be together?

Solution attempt:

3 vowels and 5 consonants

Arrangements with no restrictions = 8! = 40320All (three) vowels together = 6!3!=4320Two vowels together = 7!2!=10080

So,

No vowels
together = No restrictions – three vowels together – two vowels together=40320 – 4320 – 10080 = 25920 ways

Does my logic make sense? Have I missed any cases? I’m trying to use permutations only.

Thanks for the help!

Edit:

Thanks for all the help!

The gist I was getting from the comments was that when I subtract 2 vowels together I am also getting ‘more than 2 vowels together’ (so, three vowels). To compensate for this I should add the ways of arranging 3 vowels
together back so as to not subtract twice.

No restrictions – 2 vowels together + 3 vowels together = 8! – 7! * 6 + 6!3! = 14400

A word is to be formed using the letters of the word ALGORITHM.
There are 9 letters in the word ALGORITHM.
When no two vowels are together:
There are 6 consonants in the word ALGORITHM.
They can be arranged among themselves in 6P6 i.e., 6! ways.
Let consonants be denoted by C.
C       C       C

C       C       C

6 consonants create 7 gaps in which 3 vowels are to arrange.
∴ 3 vowels can be filled in 7P3
= `(7!)/((7-3)!)=(7xx6xx5xx4!)/(4!)` = 210 ways
∴ Total number of ways in which the word can be formed = 6! × 210 = 720 × 210 = 151200
∴ 151200 words can be formed if no two vowels are together.

## GMAT / GRE Mathematics Tutorial Series: Permutations And Combinations

Nội dung bài viết

• GMAT / GRE Mathematics Tutorial Series: Permutations And Combinations
• Permutations
• Factorial Formula
• Important Permutation Formulae
• Solved Permutation Examples
• Combinations
• Important Combination Formulae
• Solved Combination Examples

In this article, we’ll cover the basic definitions, formulas and solved examples of Permutation and combination.

Definition:
Permutation is the process of arranging the members of a set into a sequence. For e.g.

The different ways in which the alphabets L, M and N can be grouped together, taken all at a time, are LMN, LNM, MNL, MLN, NLM, and NML.

Note that LMN and NML are not the same as the order of arrangement is different. This condition is applicable for solving any problem in Permutations.

Xem thêm:  Cho hình lập phương abcd.abcd chọn khẳng định sai

The number of ways in which n things can be arranged, taken
all at a time, is given by

nPn = n!, also called ‘n factorial.’

Also Check GMAT / GRE Tutorial Series: Ratio and Proportion

## Factorial Formula

Factorial of a number n
is defined as the product of all the numbers from n to 1.

For example, the factorial of 7, 7! = 7*6*5*4*3*2*1 = 5040.

Therefore, the number of ways in which the 5 letters can be arranged, taken all a time, is 5! = 5*4*3*2*1 = 120 ways.

The number of permutations of n things, taken r at a time, denoted by:

nPr = n! / (n-r)!

For
e.g.

The different ways in which the 4 letters, taken 2 at a time, can be arranged is 4!/(4-2)! = 4!/2! = 12 ways.

1! = 1

0! = 1

## Solved Permutation Examples

Problem
1:
Find the number of words, with or without meaning that can be formed with the letters of the word ‘GLOBE.

Solution:

‘GLOBE contains 5 letters.

Therefore, the number of words that can be formed with these 5 letters = 5! = 5*4*3*2*1 = 120 words.

Problem 2: Find the number of words, with or without meaning that can be formed with the letters
of the word ‘EVENT’.

Solution:

The word ‘EVENT’ contains 5 letters and the letter ‘E’ comes twice.

When a letter repeats itself more than once in a word, the factorial of the number of all letters in the word is divided by the number of occurrences of each letter.

Therefore, the number of words formed by ‘EVENT’ = 5!/2! = 60.

Also Check
GMAT / GRE Tutorial Series Quadratic Equation

Problem 3: Find the number of words, with or without meaning, which can be formed with the letters of the word ‘FOOTBALL?

Solution:

The word ‘FOOTBALL’ contains 8 letters. Of which, O occurs twice and L occurs twice.

Therefore,
the total number of words formed = 8! / (2!*2!) = 10080 words.

Problem 4: How many different words can be formed with the letters of the word ‘ANGEL’ such that the vowels always come together?

Solution:

The word ‘ANGEL’ contains 5 letters.

We have to find the number of permutations that can be formed where the two vowels A and E come together.

In
cases like these, we group the letters that should come together and consider that group as a single letter.

So, the letters are N, G, L (A, E). Now the number of words is 4.

Therefore, the number of ways in which 4 letters can be arranged is 4!

For A and E, the number of ways in which A and E can be arranged is 2!

Xem thêm:  Em hay nếu vai trò của các yếu to thiên nhiên trong việc rèn luyện sức khỏe

Hence, the total number of ways in which the letters of the ‘ANGEL’ can be arranged such that vowels are
always together are 4! * 2! = 48 ways.

Problem 5: Find the number of different words that can be formed with the letters of the word ‘CUTTER’ so that the vowels are always together.

Solution:

The word ‘CUTTER’ contains 6 letters.

The letters U and E should always come together. So the letters are C, T, T, R, (UE).

The number of ways in which the
letters above can be arranged = 5!/2! = 60 (since the letter ‘T’ is repeated twice).

Number of ways in which U and E can be arranged = 2! = 2 ways

Therefore, total number of permutations possible = 60*2 = 120 ways.

Problem 6: Find the number of permutations of the letters of the word ‘SURNAME’ such that the vowels always occur in odd places.

Solution:

The word SURNAME
has 7 letters.

There are 4 consonants and 3 vowels in it.

Writing in the following way makes it easier to arrive at the answer.

(1) (2) (3) (4) (5) (6) (7)

No. of ways 3 vowels can occur in 4 different places = 4P3 = 24 ways.

After 3 vowels take 3 places, no. of ways 4 consonants can take 4 places = 4P4 = 4! = 24 ways.

Therefore, total
number of permutations possible = 24*24 = 576 ways.

Also Check GMAT / GRE Tutorial Series Ratio Analysis

## Combinations

Definition

A
combination determines the number of possible arrangements from a collection in any order.

For example:

The different selections possible from the alphabets Q, R, S, taken 2 at a time, are QR, RS and SQ.

It does not matter whether we select Q after R or R after Q. The order of selection is not important in combinations.

To find the
number of combinations possible from a given group of items n, taken r at a time, the formula, denoted by nCr is

nCr = n! / [r! * (n-r)!]

As per the above example, the different selections possible from the alphabets Q, R, S, taken two at a time are

3C2 = 3! / (2! * (3-2)!) = 3 possible selections (i.e., QR, RS and
SQ)

## Important Combination Formulae

nCn = 1

nC0 = 1

nC1 = n

nCr = nC(n-r)

The number of selections possible with X, Y,
Z, taken all at a time is 3C3 = 1 (i.e. XYZ)

## Solved Combination Examples

Here are a few examples to understand combination.

Problem 1: In how many ways can a team of 1 boy and 3 girls be formed from a group of 3 boys and 4 girls?

Solution:

No. of ways 1 boy can be selected from a group
of 3 boys = 3C1 = 3! / 1!*(3-1)! = 3 ways.

No. of ways 3 girls can be selected from a group of 4 girls = 4C3 = 4! / (3!*1!) = 4 ways.

Xem thêm:  Top những tiktoker đẹp trai nhất Việt Nam

Problem 2: Among a set of 5 black socks and 3 red socks, how many selections of 5 socks can be made such that at least 3 of them are black socks.

Solution:

Selecting at least 3 black socks from a set of 5 black
socks in a total selection of 5 socks can be

3 B and 2 R

4 B and 1 R and

5 B and 0 R socks.

Therefore, our solution expression looks like this.
5C3 * 3C2 + 5C4 * 3C1 + 5C5 * 3C0 = 46 ways.

Problem 3: How many 4
digit numbers that are divisible by 10 can be formed from the numbers 1, 5, 4, 8, 9, 0 such that no number repeats?

Solution:

If a number is divisible by 10, its units place should contain a 0.
_ _ _ 0

After 0 is placed in the units place, the tens place can be filled with any of the other 5 digits.

Selecting one digit out of 5 digits can be done in 5C1 = 5
ways.

After filling the tens place, we are left with 4 digits. Selecting 1 digit out of 4 digits can be done in 4C1 = 4 ways.

After filling the hundreds place, the thousands place can be filled in 3C1 = 3 ways.

Therefore, the total combinations possible = 5*4*3 = 60.

Practise questions

1) Solve the following.

1. i)
30P2

ii) 30C2

A. 870, 435
B. 435, 870
C. 870, 470
D. 435, 835

Explanation:

30P2 = 30! / 28! = 30*29*28! / 28! = 30*29 = 870.

30C2 = 30! / (2!*28!) = 435.

2) How many different possible
permutations can be made from the word ‘MALLET’ such that the vowels are never together?

A. 360
B. 120
C. 480
D. 240

Explanation:

The word ‘MALLET’ contains 6 letters of which 1 letter occurs twice = 6! / 2! = 360

No. of permutations possible with vowels always together = 5! * 2! / 2! = 120

No.
of permutations possible with vowels never together = 360-120 = 240.

3) In how many ways can a team of 3 boys and 2 girls can be made from a group of 5 boys and 5 girls?

A. 10
B. 20
C. 30
D. 100

Explanation: 5C3 * 5C2 = 100

• GMAT / GRE Mathematics Preparation Guide: Distance, Time and Speed
• GMAT / GRE Mathematics Preparation Guide: Lines & Angles
• GMAT / GRE Mathematics Preparation
Guide: Probability
• GMAT / GRE Mathematics Preparation Guide: Profit & Loss
• GMAT / GRE Mathematics Preparation Guide: Quadratic Equation
• GMAT / GRE