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

Emma's Dilemma

Extracts from this document...


Emma’s Dilemma

        Emma and Lucy are experimenting with the arrangements pf the letters in their names.

        I am going to look into how many arrangements of the word Lucy there are; I am then going to find to find all of the arrangements for words with other numbers of letters in them.

        I am looking for a link between the number of letter in a word and the number of different arrangements of the letters there are.


I am starting off with the word Lucy; I am going to write out all the different arrangements of the letters in the name.

 LUCY                LUYC                LYUC                LYCU                LCUY                LCYU        

 ULCY                ULYC                UYLC                UYCL                UCLY                UCYL        

 CYLU                CYUL                CULY                CUYL                CLYU                CLUY        

 YLUC                YLCU                YCUL                YCLU                YULC                YUCL

        There are 24 different combinations for the word Lucy.

I can see from this that the first letter in any arrangement of the letters can be one of N letters (where N is the number of letters in the word). Therefore the second letter can be one

...read more.


        I predict that words with 1 letter repeated twice will have fewer arrangements than words with no repeated letters. I think this because for every combination of letters there will be another that is exactly the same because all you have done is swap around the two repeated letters.


EMMA        EMAM        EAMM        MMAE        MAME        MEAM

MAEN                MEMA        MMEA        AEMM        AMEM        AMME EMMA        EMAM        EAMM        MMAE        MAME        MEAM

MAEN                MEMA        MMEA        AEMM        AMEM        AMME

The letters in italics         have already been written out but using the other m, so therefore there is half the amount of possible combinations. This means that to get the number of possible combinations of a word with one set of letters repeated twice you would have to divide by 2 so that you get half the number of results.

Therefore the expression used  to work out the number of possible combinations of a word with one set of letters repeated twice is:

N!This means that you would divide the factorial of

  1. the length of the word by 2.

I am going to test

...read more.


           6!    _          _        = 90

             2!  2!  2!

I am not going to write out all of the combinations for Hannah because I do not feel that I need to.


        I am now going to test my theory on the name PHILLIP because it has a different number of letters to the word HANNAH.

           7!    _          _        = 630

             2!  2!  2!

Both of these calculations seem to work because they come up with reasonable answers when you compare them to the original N! of the word.

I can see that both of these words work with the expression:


R1! R2!

This expression means that you divide the factorial of the number of letters (N!) by the factorial of the number of first set of repeated letters (R1!) by the factorial of the second set of repeated letters (R2!), this can be done with however many sets of repeated letters there are.


I am lastly going to try my expression with the name ANASTASIA

Because it has a lot of letters in the word and two sets of repeated letters:

           9!    _          _        = 7560

               4!  2!

So the expressions for working out the number of combinations available for any word are these:

N!                -for a word without any repeats

N!-for a word with one set of repeated letters


      N!         _        -for a word with any amount of  sets of repeated letters

R1! R2!

...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

    I know my rule works for Four letters and below, and trying to write out the combinations of any number higher than this ( even 5 letters which would produce 120 different combinations ) would only waste time, and effort.

  2. Emma’s Dilemma

    Now with the word XXX_ _ there would only be 20 possible arrangements if the remaining letters were different. In the case of the word XXXYY they are not different and because when you have a 5-letter word with 2 letters the same then there are only 60 possibilities as proved in proof 2d.

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

    Many of the example I will give will repeat arrangements I have worked out for previous sections, but I will include them to show a complete set of results. One X and an increasing number of Y's One X and No Y's X One X and One Y: XY Total:

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

    There is also a letter (A) which comes up 2 times in the word. Therefore I get 2! which is equal to 2. So I get ( 1 ) x ( 1 ) x ( 1 x 2 ) = 1 x 1 x 2 = 2 So we get:

  1. Investigating the arrangements of letters in words.

    After a while I found that if I did the basic formula-n!/a! (Presuming a is the number of letters the same) I got twice the amount I had for the combination. From there it was quite simple-I tried doing (n!/a!)/2 and got the right amount for the combinations.

  2. I am doing an investigation into words and their number of combinations. I will ...

    AAABA AAAACB=5 Total=1 AABAA AAACAB=5 ABAAA AACAAB=5 BAAAA ACAAAB=5 CAAAAB=5 Total=5 Total=30 I will now try and find a formula for this pattern. First I will simplify the data by putting it in a table: Number of letters Combination (C)

  1. Emma's Dilemma

    EYYLY EYLYY ELYYY LYYYE LYYEY LYEYY LEYYY There are 20 different arrangements. TABLE OF RESULTS Number of different arrangements (a) Number of letters (n) No letter repeated One letter repeated 2? One letter repeated 3? 2 2 1 N/A 3 6 3 1 4 24 12 4 5 120 60

  2. Emma’s Dilemma.

    A 23 1 5 4 2 3 K E I A C 24 1 5 4 3 2 K E I C A 25 2 1 3 4 5 A K C I E 26 2 1 3 5 4 A K C E I 27 2 1 4 3

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