• 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: 2422

# Emma's dillemma

Extracts from this document...

Introduction

Mathematics Coursework

Introduction: In this coursework I will be investigating “Emma’s dilemma” which is about permutations of letters. I will see how many permutations of the word “Lucy”. Then I will continue my investigation by finding the amount of permutations in a word that has 2 letters the same such as the word “Emma”. In order to fully understand the work and find patterns between the words and arrangements, I will need to structure it to show how I got from one point to the other. To further my investigation I will see how many permutations there are in various groups of words such as, words that have 3 letters the same and the rest different, and I will expand on this theory to find patterns relating to the work.

Part 1: For the first part of this investigation I will be finding out how many permutations there are in words that have all the letters different. I have decided to use A, B and C to make up a 1 letter word, 2 letter word and a 3 letter word such as A, AB and ABC.

A is a one letter word that has only one permutation = A

AB is a two letter word that has two permutations = AB and BA

ABC is a three letter word that has six permutations =

Middle

for letters in a word that are different and it is that if n is equal to the number of letters in a word, then nfactorial will be the differentnumber of permutations of thatword.

Part 2:Now I will further my investigation by looking at words with 2repeatedletters. I will be comparing if there is a link between words with differentletters and words with repeatedletters. I will see if the same formula is to be applied for words with repeatedletters as it was in the firstpart for letters that are different. I will use the word “Emma” as my starting block and I will be investigating on from there.

Hypothesis: I do, however feel that there will be lesspermutations in “Emma” due to the fact that twoletters are repeated, because twoletters are repeated it reduces the amount of permutations by half due to it having4letters in total and 2 of themrepeated. This is what I think at the moment but continuing my investigation will let me solve the problem.

As in the firstpart I will start off by using a 2letterword with the lettersrepeated, then a 3letterword with two letters repeated and a four letter word with two lettersrepeated i.e. Emma. To further my enquiry I will then do a 5letterword with twolettersrepeated to confirm my

Conclusion

prove it and so now I will be testing this new idea on a 6 letter word with 3 repeated letters. The word I will be using will be ATAXIA.

I expect it to give me 6! ÷ 3! = 120 permutations

ATAXIA is a 6letterword with 3repeatedletters and it gives 120permutations =

ataxia ataxia ataxia ataiax ataaix ataaxi ataxia atxaai atxiaa atixaa atiaxa atiaax aatxia

aatxai aatixa aatiax aataix aataxi aaxtia aaxtai aaxita aaxiat aaxait aaxati aaixta aaixat

aaitxa aaitax aaiatx aaiaxt aaaxit aaaxti aaaixt aaaitx aaatix aaatxi axatia axatai axaita

axaiat axaait axaati axtaia axtaai axtiaa axitaa axiata axiaat aiaxta aiaxat aiatxa aiatax

aiaatx aiaaxt aixata aixaat aixtaa aitxaa aitaxa aitaax taaxia taaxai taaixa taaiax taaaix

taaaxi taxaia taxaai taxiaa taixaa taiaxa taiaax txaaia txaaai txaiaa txiaaa tiaxaa tiaaxa

tiaaax tixaaa xtaaia xtaaai xtaiaa xtiaaa xataia xataai xatiaa xaatia xaatai xaaita xaaiat

xaaait xaaati xaiata xaiaat xaitaa xiaata xiaaat xiataa xitaaa itaxaa itaaxa itaaax itxaaa

iatxaa iataxa iataax iaxtaa iaxata iaxaat iaaxta iaaxat iaatxa iaatax iaaatx iaaaxt ixataa

ixaata ixaaat ixtaaa

Conclusion: By testing the formula and finding out that it work I finally think that this is the right formula to work out any number of permutations; if you use this method you will be able to work it out. The method is: to find out the number of permutations in a word you do the number of letters (factorial) ÷ the number of repeated letters (factorial).

Key: (n) = number of letters

(r) = number of repeated letters

(!) = Factorial

Formula:     n!        = Number of permutations.

r!

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

by the number of times the first repeated letter is repeated FACTORIAL, timesed by the number of times the second repeated letter is repeated FACTORIAL timesed by "etc.". This is because when a letter is repeated, it can be swapped with its self, with-out making a new arrangement.

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

the same letter the same and 3 of another letter the same. (eg AABBB) 5 letters 6 letters 7 letters AABBB AABBBC=10 AABBBCD=60 ABABB AABBCB=10 AABBBDC=60 ABBBA AABCBB=10 AABBDBC=60 ABBAB AACBBB=10 AABDBBC=60 BAABB ACABBB=10 AADBBBC=60 BABAB CAABBB=10 ADABBBC=60 BABBA DAABBBC=60 BBAAB Total=60 BBBAA Total= 420 BBABA Total=10 Now I'll try

1. ## Dave's Dillemma.

This gives us a formula: x!/n! x is the total number of letters in the name chosen, whereas n is the number of letters which are the same. I am going to test the formula on the name EMMA: 4!

2. ## Emma's Dilemma - Rearranging Emma's Name in different permutations

Once I have discovered these formulae I am going to investigate, other combinations of letters and different amounts of letters. I will then try to discover a link between the formulae to enable me to find a formula for the general case.

1. ## Emma's Dillemma - Rearranging Emma's Name in different permutations

120 divided by 6 (number of letters) equals 24. Previously in the 4-letter word, 24 divided by 4 equals 6, the number of possibilities there were for each letter. For the sake of convenience I have used lucy and put a q in front of it to show that there

2. ## Emma&amp;amp;#146;s Dilemma.

Altogether I have come up with 120 permutations for a name with five different letters. Judging from the results I have got so far, if I continue with even longer names then there are going to be too many permutations to document.

1. ## Emma's Dillemma

25 Rraby 35 Rybra 6 Byarr 16 Arbry 26 Rrbya 36 Ryrab 7 Brray 17 Arybr 27 Rrbay 37 Ryrba 8 Brrya 18 Aryrb 28 Rryab 38 Raybr 9 Brayr 19 Ayrrb 29 Rryba 39 Rayrb 10 Brary 20 Ayrbr 30 Ryrba 40 Rabry 41 Rabyr 51 Yrrab 42 Rarby

2. ## Emma's Dillemma

Qlucy qucyl qqcylu qycul Qluyc qucly qcyul qyclu Qlcuy qulcy qculy qyulc Qlcyu qulyc qcuyl qyucl Qlyuc quycl qclyu qylcu Qlycu quylc qcluy qyluc I can see that the numbers of possibilities for different arrangements are going to dramatically increase as more different as more letters are used.

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