• 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

The Problem

Emma is looking at the different arrangements of her name.

1)        Find the different arrangements of Emma’s name.

2)        Emma has a friend named Lucy; find the different arrangements of her         name.

3)        Investigate the number of different arrangements of the letters of names         you have chosen.

Investigating the Problem

To investigate this problem I am going to look at the different arrangements of a four letter name with two letters the same and a four letter name with all different letters. I am then going to try three and five letter names, with two letters the same and all different. I am then going to look at the results and predict the next set. I will then move on to three and four letters the same.

Four Letter Words



One/Two Letter Words

We know that a one letter word will only have 1 combination. For two letters we know that it only has 2 different combinations and 1 for both letters repeating:

  1. A
  1. AB
  2. BA
  1. AA

Three Letter Words


Five Letter Words

James is a five letter word with different letters.

...read more.





From the results we can already see a pattern. The combination for all different letters divided by two equals that of two letters the same in a word.


By looking at the results I have found a pattern. The table below highlights the pattern.
















To predict the result for 6 letters:

120 X 6 = 720

To check this:

Let’s take ABCDEF. We know that by putting the A at the front of the word, we are only changing a five letter word. The results for a five letter word with different letters in 120.

120 X 6 = 720

This is the same sum as the pattern that I found. So, we can predict the results for the rest of the numbers by using this rule.


The factorial button on a calculator [ ! ] proved very helpful in finding out the rule to Emma’s Dilemma.  

Factorial means multiplying itself by all the numbers lower than itself until reaching 1.

e.g.        3!        =        3 X 2 X 1 = 6

        4!        =        4 X 3 X 2 X 1 = 24

By using the factorial rule, the number of combinations is easier to work out.

...read more.


( n ! / 2 ) / 3                        simplified        n!/6         because 2 X 3 = 6

I predict that for four letters the same the formula would be:

( ( n ! / 2) / 3 ) / 4                simplified        n!/24        because 2 X 3 X 4 = 24

The Formula

There is in fact a link between the formulas shown above where you divide n! by 2, 6, 24 e.t.c. and the factorial numbers itself. By looking at the numbers we can see that 2, 6, 24 is in fact 2!, 3!, 4! and so on.

( n ! / 2 ) / 3                 =                n!/6                =        n!/2!

( ( n ! / 2) / 3 ) / 4        =                n!/24                =        n!/3!

Let’s put this in a table:






All different

2 the same

3 the same

Notice that the 2! or 3! that n! is divided by equates to the number of letters  the same in each word. By using the information on this page we can find a general formula for the ‘dilemma’.





        N        is the number of letters in the word;

        L        is the number of letters the same.

This formula is a general rule for all combinations containing any number of letters with a number of letters the same (excluding combination of letters that have more than one letter repeated, i.e. AABB cannot use this formula).

...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 created a table but instead replaced the starting letter i.e. I replaced the L for E, U for M, C for M and Y for A. the diagram below displays what I mean: L U C Y E M M A letter 1 letter 2 letter 3 letter 4

  2. Emmas dilemma.

    in front of them, therefore the 'Y' can move into five different positions throughout the word, therefore that is why we multiply 24 by 5. I will now investigate more words with one set of repeated letters: AA: AA, only one combination, this is half as many as a normal 2 lettered word.

  1. Emma's Dilemma

    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 EMMA EMAM EAMM MMAE MAME MEAM MAEN MEMA MMEA AEMM AMEM AMME EMMA EMAM EAMM MMAE MAME MEAM MAEN

  2. Emma's Dilemma

    The example I will be using is 'Ed.' Ed Whilst listing the various possibilities I will try and be as systematic as I possibly can. ED DE 2 POSSIBILITIES When I was listing out the different possibilities I split the word into two parts, as there are only two different letters.

  1. Emma's Dilemma

    The second name I will investigate is JJ. JJ I have found 1 arrangement for the name JJ. If I make the double- letter different then there will be the same amount of arrangements as Ben. JJ JJ There is the same amount of arrangements as TJ when I make the 'J's different.

  2. Emma's Dilemma

    There were 6 different arrangements of the letters in that too so the results above are credible: DOM ODM MDO DMO OMD MOD There seemed to be a pattern developing but there was not yet enough evidence to make it conclusive.

  1. Emma's Dilemma

    Now I am going to investigate the number of arrangements in Emma's name: 1. EAMM 2. EMAM 3. EMMA 4. MEAM 5. MMEA 6. MMAE 7. MAEM 8. MAME 9. AMME 10. AEMM 11. AMEM 12. MEMA To work this out without writing all the combinations down I will have

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

    The number of different arrangements ( D ) possible is therefore given by: D = t ! ( n + p ) ! n ! X p ! or n ! X p ! For Example If I use 4 X's, and 3 Y's, giving a total of 7 letters, then from the formula above, the number of different arrangements should be: D = t !

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