• Join over 1.2 million students every month
• Accelerate your learning by 29%
• Unlimited access from just £6.99 per month
Page
1. 1
1
2. 2
2
3. 3
3
4. 4
4
5. 5
5
6. 6
6
7. 7
7
8. 8
8
9. 9
9
10. 10
10
11. 11
11
12. 12
12
13. 13
13
14. 14
14
15. 15
15
• Level: GCSE
• Subject: Maths
• Word count: 2493

# Emma's dilemma.

Extracts from this document...

Introduction

Emma’s dilemma

Part 1

I am investigating the different combinations that are possible to create by rearranging the letters of the word Lucy. I will mix up the letters to find as many different possibilities of arrangements as possible, for example LUCY rearranged could be ULCY or LYUC. I will try a systematic method of rearrangement that should show that I haven’t missed out any potential arrangements. Later I will go on and investigate bigger words that include repeated letters like successfully.

Methodology

I am abut to write out all the possible rearrangements of the name Lucy starting with all the combinations starting with the letter L then U, C and Y

Hopefully I will notice a pattern that will be able to show how many amalgamations can be made with a word and then apply it to others to predict the rearrangements of any word no matter how big without the laborious process of writing all of the combinations out.

 L U C Y L U C Y U L C Y C L U Y Y L C U L U Y C U L Y C C L Y U Y L U C L C U Y U C L Y C U L Y Y U C L L C Y U U C Y L C U Y L Y U L C L Y C U U Y C L C Y U L Y C U L L Y U C U Y L C C Y L U Y C L U

LUCYULCYCLUY   YLCU

Once I had written down the first letter (orange) the other three letters (blue) could only be used twice each as the second letter of the combination, since the remaining two letters could only be rearranged twice to give a new combination .There are twenty four different arrangements of LUCY and four letters in the name, there are six possible combinations that can be made starting with each letter.

E.g.

 L U C Y L U Y C

Middle

E

A

M

M

E

A

M

A

M

M

E

E

A

M

M

M

A

E

M

M

A

E

M

A

M

M

E

E

A

M

M

M

A

M

E

M

A

M

E

A

M

E

M

I have encountered a problem with this table as there are only twelve viable combinations of EMMA despite it having the same amount of letters as Lucy, there are only half the number of combinations .I have crossed out and highlighted in blue the combinations that are not acceptable. They are not acceptable because they look exactly the same as the other twelve combinations and the only way to distinguish them is to colour code them. This is because one of the letters is repeated and it means that despite having twenty four combinations using different letters, twelve of them look exactly the same as the other twelve. E.G.

I am highlighting one M in orange so it is possible to differentiate between the two M’s:

EMMA and EMMA are exactly the same word although they have the swapped the letters of the M’s around it is the word so one is cancelled and because the M’s are repeated twice each combination is going to be repeated twice, there is going to be half the amount of combinations

Part 3

In this section I will research and test as many different methods to work out the different combinations of a word. I will investigate the combinations of various varying words. I will work out an equation to make the task of finding a word’s combinations, simpler as opposed to writing out all combinations by hand.(a very tedious task with words of many letters. And finally to find one that can be used to predict any word’s combinations.

Methodology

I will write out all the combinations for words with one letter, two letters, three letters and four letters. And try to find a pattern and/or equation, using a systematic method as shown in part one.

One letter

C

This has 1 combination

Two letters

 C Y Y C

2 combinations

Three letters                          four letters

 L U C Y L U Y C L C U Y L C Y U L Y C U L Y U C U L C Y U L Y C U C L Y U C Y L U Y C L U Y L C C L U Y C L Y U C U L Y C U Y L C Y U L C Y L U Y L C U Y L U C Y U C L Y U L C Y C U L Y C L U U C Y U Y C C U Y C Y U Y C U Y U C

This has 6 combinations

This is another pattern explanation to show how to prove prediction of combinations:

To every word that you add another letter to, you can place the new letter between each letter of the combinations of the old word to make new combinations

E.G:

1                 2                     3                    4                   5                   6

E   D  A ,   E   A   D    ,    A   E   D   ,   A   D   E   ,   D   A   E   ,   D   E   A

A new letter could have been placed between any of these letters and it would have produced a new combination. Since there are four possible places for the new letter to be placed in, you can multiply four by the number of combinations from the previous word, in this case it would be six. Four × six equals twenty four which is the number of combinations for a four letter word with no repetitions.

 Number of combinations Number of letters in a word 1        × 1 2        × 2 6        × 3 24 4

Conclusion

E.G.

With AB adding the letter C:

It can be placed any where to make a new combination:    A   B

3×2×1=6

B   A

But adding a letter that is already there like B:  A   B

B   A

3×2×1=6

2×1=2

In this case you have to divide the second word by two which gives you three, half of what the number wouldn’t have been if it wasn’t for the repeated letters.

However this would not work with words such as AABBB or AABB

But if I divided the number of letters in the word by two factorial numbers, one for each set of repeated letters

E.G.

AABB   4!         =             24    =         6

2! ×2!                       4

AABB

ABBA

BBAA

ABAB

BABA

BAAB

Six combinations

This has the same principles as only one set of repeated letters except that you need to add another factorial for a new set of repetitions.

Now I will apply this to a word with unequal numbers of repeats to show that it works.

BBAAA

ABBAA

AABBA

AAABB

BABAA

BAABA

BAAAB

ABABA

ABAAB

AABAB

Ten combinations

5!   =        120   =        10 combinations which is right so my adapted theory is

2! ×3!         12        SUCCESSFUL

I will now use my formula on SUCCESSFULLY which has four sets of repeated letters to tell you how many times it can be rearranged

11!                =   39916800    =   831600 combinations

3!×2!×2!×2!        48

This student written piece of work is one of many that can be found in our GCSE Emma's Dilemma section.

## Found what you're looking for?

• Start learning 29% faster today
• 150,000+ documents available
• Just £6.99 a month

Not the one? Search for your essay title...
• Join over 1.2 million students every month
• Accelerate your learning by 29%
• Unlimited access from just £6.99 per month

# Related GCSE Emma's Dilemma essays

1. ## Emma's Dilemma

This will allow me to make comparisons between having letters all different, and having some letters which are the same. In the second part of this question, I will be writing down the arrangements for letters combinations which have one letter repeated twice.

2. ## EMMA's Dilemma Emma and Lucy

According to the formula, I expect the total arrangement for this is a=(1*2*3*4*5)/(3*2*1*2*1)=10 11122 12211 11212 21112 11221 21121 -------10 arrangements 12112 21211 12121 22111 The formular still works. Let's try 7 fig, with 3 same number, and 4 same number.

1. ## permutations &amp;amp; combinations

MAME 6. MMEA 7. MMAE 8. AMME 9. AMEM 10. AEMM 11. MAEM 12. MEAM EM1M2A - This is the same spelling as the one above, however the two M's have been given numbers. 1. EM1M2A 2. EM2M1A 3. EAM2M1 4. EAM1M2 5. EM1AM2 6. EM2AM1 7. AEM1M2 8.

2. ## Emma's Dilemma Question One: Investigate the number of different arrangements of the letters

This formula is shown below: No. of = No. of letters ! combinations ( no. of times a letter X ( no. of times a letter has been repeated ) ! different has been repeated ) ! As you can see, the factorial symbol has been added to the ends of each part of this equation.

1. ## I have been given a problem entitled 'Emma's Dilemma' and I was given the ...

The equation works for AABB if it is written as follows: Y = X! / 2! x 2! For the word AAABB, there are 10 permutations and as the word is a five letter word, the starting point of 5!

2. ## Emma is playing with arrangements of the letters of her name to see how ...

I will investigate the number of different arrangements for any word with any number of letters. I will use the letters X and Y to start with. X I can see that for these, the number of XY combinations is the same as the number of XXY letters.

1. ## Investigating the arrangements of letters in words.

and now I think I have found a successful method for letters with 2 pairs the same; letters with a couple the same and 3 others the same; and letters with 2 the same and 4 others the same. It seems that after n!

2. ## In this piece of coursework my initial aim is to investigate how many different ...

number of possible combinations, n!, by the factorial of the number of repeated letters in this case that is 2!. One Triple Letter- 3 letters- AAA 4 letters- AAAB AABA ABAA BAAA 5 letters- AAABC AAACB AABAC AABCA AACBA ABAAC ABACA ABCAA ACAAB ACABA ACBAA BAAAC BAACA BACAA BCAAA CAAAB CAABA CABAA CBAAA No.

• Over 160,000 pieces
of student written work
• Annotated by
experienced teachers
• Ideas and feedback to