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

Emma's Dilemma

Extracts from this document...

Introduction

Mathematics GCSE coursework: Emma's Dilemma

In my investigation I am going to investigate the number of possible arrangements of the letters in peoples names.

I start with the least possible amount of letters, which is one:

J

This clearly only has one arrangement.

I will now go on to investigate the number of arrangements of letters in names going up in order of the number of letters that they contain:

AL

LA       (2 arrangements)

SAM
SMA
ASM
AMS
MSA
MAS    (6 arrangements)

LUCY

LCUY

LCYU

LUYC

LYCU
LYUC
ULYC
ULCY
UCLY
UCYL
UYCL
UYLC
CLUY
CLYU
CUYL
CULY
CYLU
CUUL
YLUC
YLCU
YULC
YUCL
YCUL
YCLU   (24 arrangements)

I can see that if the name has no letters that are repeated I can work out the number of different possibilities more easily. I have worked out that when I have exhausted the different number of possible combinations starting with the same letter I can times that by the number of letters in the word to work out the number of formulas. For example, when doing the name Lucy I can cut down the time it would take to work out the name.

LUCY

LCUY

LCYU

LUYC

LYCU
LYUC

SIMON
SIMNO
SIOMN
SIONM
SINOM
SINMO
SMION
SMOIN
SMINO
SMONI
SMNOI
SMNIO
SOIMN
SOINM
SOMIN
SOMNI
SONIM
SONMI
SNIMO
SNIOM
SNMIO
SNMOI
SNOIM
SNOMI

(There are 24 combinations, so taking into account that this number would be possible starting with each letter there will be 24*5 combinations which equals 120 combinations)

Here is a table containing all of the results that I have recorded. Hopefully when I have rounded them all together I might be able to work out a recurring pattern.

 Number of letters (N) Number of combinations 1 1 2 2 3 6 4 24 5 120

Middle

EMMMA

EAMMM

MEAMM

MEMAM

MEMMA

MMEMA

MMMEA

MMEAM

MMMAE

MMAME

MMAEM

MAEMM

MAMEM

MAMME

AEMMM

AMEMM

AMMEM

AMMME (3 letters the same, 20 combinations)

On the following page is a table containing the results for the words that I have just used. Hopefully, by studying these, a pattern will become clearer and I might be able to make sense of why these patterns emerge.

 No. of letters No. of letters the same No. of combinations No. of combinations with no letters the same 3 2 3 6 4 2 12 24 5 2 60 120 5 3 20 120

Looking at these results we can see that the number of combinations for each name are half that of the number of combinations when there are no letters the same. This works fine up until when, on closer inspection, this only works for the names that have two letters the same. So when that original theory is used on a name that has more than two letters the same it doesn't work. The obvious and simple answer that comes to mind is to divide the number of combinations when no letters are the same by the number of letters the same. This would work up until we come to the word with three letters the same and it doesn't work. Working on the basis that the number of combinations when no letters are the same will have to be divided to come up with

Conclusion

N! / (A!)(B!)

This follows the same method as the previous equation. In the previous there was only one letter that repeated, but in the case of a word that has more than one letter that repeats, you still divide by the number of letters repeated, but you also divide by the other letter that repeats as well. So A is the first letter that repeats more than once and B is the second letter that repeats more than once. So effectively the longer the word goes on and has letters that repeat, the longer the equation will be. However many letters there are that repeat, there will be that amount of brackets.

This can be tested and verified using the combinations that I worked out previously for the word XXXYY:

XXXYY
XXYXY
XXYXX
XYXXY
XYXYX
XYYXX
YXXXY
YXXYX

YXYXX
YYXXX

There would usually be 120 combinations. But, as there are letters the same it will be reduced. Using the formula N! / (A!)(B!) I can work out that there will only be 10 different combinations. The original number, 120, has been divide by 12 to get the number of combinations for this word and 12 = (3*2)(2*1), this proves that the formula works. The reason that there are this number of combinations is that, as explained earlier in my investigation, there will be lots of combinations that will be exactly the same as each other.

Now that I have worked out these equations I can work out the number of combinations for absolutely any word:

MATHEMATICS = (11*10*9*8*7*6*5*4*3*2*1)

(2*1)(2*1)

=   9979200

HYPOTENUSE    = (10*9*8*7*6*5*4*3*2*1)

(2*1)

=  1814400

FACTORIAL        = (9*8*7*6*5*4*3*2*1)

(2*1)

=  181440

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. Maths GCSE Coursework: Emma's Dilemma

= 30 combinations I used the same systematic method as before to find these results. I have also come across another analysis. I also came across another analysis. In the first and second column, I came across one combination in which the last three letters were all different and

2. permutations &amp;amp; combinations

In this word we are taking all the letters separately so we get 120 variations. In the other word, there are 5 letters but 3 similar for one letter and two similar for the other. So the formula for A1A2A3B1B2 will be 5!

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

X 2!) 5 30 = 5! / (2! X 2!) Table 5, Two letters repeated three times: Number of Letters: Number of different combinations: 6 20 = 6! / (3! X 3!) Rule: From these sets of results, I can see that if I expand the rule I found to solve "Two letters repeated twice", then this rule

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

I will now compare the results for both parts of my investigation. 6 24 120 720 5040 (x) No. of combinations for x's and y's 3 4 5 6 7 I can see from my table of results that x (number of arrangements for 1x and n y)

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

In this equation for the word AABB, the number 4 is not a factorial, however the number 2 is and 2 times 2 is equal to 4. This is interesting as there were two sets of letters repeated twice and there may be a link here.

2. GCSE Mathematics: Emma's Dilemma

This is my prediction, let's investigate and try to extract a formula to confirm my prediction: Number Of Letters Number Of Combinations 3 6 4 4 x 6 5 4 x 6 x 5 6 4 x 6 x 5 x 6 7 4 x 6 x 5 x 6

1. Investigating the arrangements of letters in words.

But do not no yet) just like the first one did. At this point I would like to note something that crossed my mind as I worked out the formula. I realised that the (a!x2!) part was the same as (2!x2!)

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