• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

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 =

...read more.

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

...read more.

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!

...read more.

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

See related essaysSee related essays

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.

    to find a formula for this pattern, bearing in mind my thoughts from the last section. First, to make things clearer, I'll simplify the data by putting it in a table: Number of letters C n!/a!x2! n!/a!x3! Working 5 letters 10 30 10 5!/(2!x6)=10 6 letters 60 180 60 6!/(2!x6)=60

  1. Dave's Dillemma.

    The number of letters multiplies the previous number of arrangements each time. e.g. -no. of letters = 4 no. of arrangements = 24 (previous number of arrangements) -no. of letters = 5 (number of letters in this case) Here are some different arrangements in terms of x's and y's: Arrangements

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

    Maybe it would be easier to see what is happening if I used larger words. What if there was a five-letter word? How many different arrangements would there be for that? As I have found that there were 24 arrangements for a 4 letter word with all different letters and

  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’s Dilemma.

    # Of Permutations = # Of Letters ! Using this formula I can also now work out how many permutations there would be for names with more than five letters: # Of Letters 1 2 3 4 5 6 7 8 9 10 Letters !

  1. Emma's Dillemma

    52 Yrabr 43 Raryb 53 Yrarb 44 Rbayr 54 Yrbar 45 Rbary 55 Yarbr 46 Rbray 56 Yarrb 47 Rbrya 57 Yabrr 48 Rbyra 58 Ybrra 49 Rbyar 59 Ybrar 50 Yrrba 60 Ybarr 1 Hannah 31 Ahnnha 61 Nhaahn 2 Hannha 32 Ahnnah 62 Nhaanh 3 Hanhna 33 Ahnanh

  2. Emma's Dillemma

    What shall I do if there are repeat letters? Like Emma; it has 4 letters but 2 of which are the same. 4 factorial equals 24, but I could only find 12, which means that there more to it that just factorial in that way.

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