• 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
• Level: GCSE
• Subject: Maths
• Word count: 1334

# Emma&amp;#146;s Dilemma.

Extracts from this document...

Introduction

Emma’s Dilemma

Question 1

There are 12 ways of writing EMMA, they are:

1. EMMA
2. EMAM
3. EAMM
4. MEMA
5. MMEA
6. MAEM
7. MMAE
8. MEAM
9. MAME
10. AMEM
11. AMME
12. AEMM

It takes a long time to think of and write all of the different combinations EMMA but there is a way of shortening the task. If you look at all of the different combinations of EMMA all starting with E then you will find that there are only 3.

1. EMMA
2. EMAM
3. EAMM

When you have done this you can then multiply 3 by the number of letters in the word, in this case 4. So the sum is 3 x 4= 12.

## Question 2

I will now use the same rule for the name LUCY to see if this rule works constantly.

All of the combinations of LUCY beginning with L

1. LUCY
2. LCUY
3. LCYU
4. LUYC
5. LYUC
6. LYCU

As we can see there are 6 ways of writing LUCY beginning with L so we times this by the number of letters in the word and we get the sum 6 X 4 = 24.

1. LUCY
2. LCUY
3. LCYU
4. LUYC
5. LYUC
6. LYCU
7. CULY
8. CLUY
9. CYLU
10. CYUL
11. CUYL
12. CLYU
13. UCLY
14. ULCY
15. UYCL
16. UYLC
17. ULYC
18. UCYL
19. YCLU
20. YCUL
21. YLUC
22. YLCU
23. YULC
24. YUCL

The reason that there are more ways of writing LUCY than EMMA although they both have the same amount of letters is that EMMA has two letters that are the same.

Middle

12 (number of ways of writing PIPPA beginning with P) X 5 (number of letters in the word)

3 (number of letters the same in the word).

## OR MORE SIMPLY:

12 X 5

As you can see there are, indeed 20 ways of writing PIPPA.

1. PPPIA
2. PPPAI
3. PPAIP
4. PPIAP
5. PPIPA
6. PPAPI
7. PAIPP
8. PIAPP
9. PAPPI
10. PIPPA
11. PIPAP
12. PAPIP
13. IPPAP
14. IAPPP
15. IPAPP
16. IPPPA
17. AIPPP
18. APIPP
19. APPIP
20. APPPI

I am now going to look at a number of different words all with letters repeated. I predict that there will be 10 ways of writing XXXYY. I know this because there are six ways of writing it with X at the beginning so the equation that I get is 6 x 5  =  10.

3

1. XXXYY        1. YYXXX
2. XYYXX        2. YXYXX
3. XXYYX        3. YXXYX
4. XYXXY        4. YXXXY
5. XYXYX
6. XXYXY

3 letter word with 2 letters repeated.

1. XXY
2. XYX
3. YXX

4 letter word with 3 repeated.

1. XXXY
2. XXYX
3. XYXX
4. YXXX

5 letter word with 4 repeated.

1. XXXXY
2. XXXYX
3. XXYXX
4. XYXXX
5. YXXXX

6 letter word with 5 repeated.

1. XXXXXY
2. XXXXYX
3. XXXYXX
4. XXYXXX
5. XYXXXX
6. YXXXXX

So once we have worked out how many ways there are of writing a word all beginning with a certain letter then we can work out the total number of combinations of that word even if it has letters repeated.

I have

Conclusion

ill get a bigger picture.
 No of letters(n) No letters repeated Same letter repeated 2x(r) Same letter repeated 3x(r) Same letter repeated 4x(r) Same letter repeated 5x(r) 3 6 3 1 0 0 4 24 12 4 1 0 5 120 60 20 5 1 6 720 360 120 30 6 7 5040 2520 840 210 42

Half of 5040        A Third 2520         A Quarter of 840

We can simply see from this table that each time that you add a letter, to be repeated, then the number of possible combinations of that word is reduced by a factor of firstly 2 then by 3 and then by 5.

All of the combinations that are in Bold Italic I have worked out using my rule.

I will now try to prove my rule.

Lets take the combination of letters XXYYZZ, I will now predict and prove both of my rules with this combination.

First of all:

1. XXYYZZ
2. XXZZYY
3. XXYZYZ
4. XZYZXY
5. XZXYYZ
6. XZYYZX
7. XZYZYX
8. XZZXYY                        X 6 = 90
9. XZZYXY
10. XYZZYX
11. XYZYXZ
12. XYXZYZ
13. XYZZYX
14. XYZYZX
15. XYZZXY

Then second:

6! (number of letters in the word)

2! X 2! X 2! (number of letters the same)

=

720

2 X 2 X 2

=

720

8

=

90

Well both of the rules seem to work so, my final equation for my second rule turn out to be

N!

R! X R!

N = number of letters in the word.

R = number of letters repeated in the word.

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

=24 combinations Letters in brackets can be rearranged I have created a table showing my results: Number of Letters Arrangements Pattern 1 1 x1 2 2 x2 3 6 x3 4 24 x4 4x3x2x1 is known as 4! (four factorial). This is shown on the graph above.

2. ## Emma's Dilemma

This brought me to the fifth part of my investigation. This is also the last and final part of the investigation. This is shown on the following page. Part 5 As mentioned above in this part of my coursework I will be investigating the various outcomes for words with more than one letter repeating.

1. ## EMMA'S DILEMMA

Then I will get the arrangement. For example 1*2*3*4*5*6 (1*2*1*2*1*2) =90 I should get this arrangement. Lets work out the arrangement, but not using the formula. 6-lettered word with 1 letter repeated twice and the second letter is also repeated twice and the final letter is also repeated twice: 1.

2. ## Emma's Dilemma

Then you have to divide the answer you get by the number of identical letters in the name. For example, Emma has 4 letters with 2 identical.

1. ## Emma's dilemma

We can see this in the tree diagram shown above. Therefore 3*2*1=3! 4. ABCD There are four letters altogether and as I said earlier in part one that four different letters word have 24 arrangements by using LUCY, the same thing is happening in this four different letters word "ABCD".

2. ## Emma's Dilemma

This is explained in more detail in section 3a. Part 3: (a). Investigating the number of different arrangements of letters in names with varying numbers of letters, where all the letters are different: Investigation: Name: "D" Number of letters:

1. ## Emma's Dilemma

PUELAI PUEALI PUEAIL PUEIAL PUEILA PLUAEI PLUAIE PLUEAI PLUEIA PLUIEA PLUIAE PLAUEI PLAUIE PLAIUE PLAIEU PLAEIU PLAEUI PLIAUE PLIAEU PLIEAU PLIEUA PLIUEA PLIUAE PLEIAU PLEIUA PLEAIU PLEAUI PLEUIA PLEUAI PILEAU PILEUA PILUEA PILUAE PILAEU PILAUE PIAULE PIAUEL PIAEUL PIAELU PIALEU PIALUE PIUALE PIUAEL PIULEA PIULAE PIUEAL PIUELA PIEUAL PIEULA PIEAUL

2. ## Emma's Dilemma.

For example there are 6 arrangements with Lucy beginning with L, and 6 beginning with u and so on. 6 X 4 (the amount of letters) gives 24. I've now found out that my first hypothesis doesn't work because Lucy has 4 letters with 4 all different and when you

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