• 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

In this investigation I will try and work out how many combinations I can make out of any type of word.

4 letters

The name EMMA has 4 letters, with 2 letters the same.  I will experiment how many combinations I can make with this name.

I find it easier to try and make each combination using one letter, then another etc.

EMMA        MEMA     MEAM    AMME

EMAM        MMEA     MAEM    AMEM

EAMM        MMAE     AEMM

The name LUCY has 4 letters, which are all different.





The name SASS has 4 letters, 3 of which are the same.



The name AAAA has 4 letters, which are all the same.

AAAA has no variations.

3 letters

The name LOU has three letters, all different.


...read more.


image04.png I shall multiply 5 X 24 to get the combinations for 5 letters. I will then half the answer I get from this to find out the combinations for 5 letters with 2 the same. I’ll divide this answer to find the combination for a 5 letter word with 3 the same, and so on.

No. of letters

All different

2 the same

3 the same

4 the same

5 the same














5X24= 120

120image03.png 2=60

60 image03.png 3=20

20 image03.png 4=5


From these results I have now found out how this works. The number of combinations is narrowed down each time there is more that 1 letter the same, or 1 letter is chosen to begin.

This is what I mean:

E.g. 2 letter word

2 choices for letter, multiplied by one choice for letter = 2

3 letter word


...read more.


E.g. 10 ! = 10 X 9 X 8 X 7 X 6 X 5 X 4 X 3 X 2 X 1

        10!  = 3, 628, 800

I can therefore say that a 10 letter word with all of the letters different could make 1, 628, 800 combinations of itself.

I have come up for this equation for finding the combination of an n letter word, with all letters different.

  N! = n x (n - 1) x (n - 2) x (n - 3) x (n - 4) x (n - 5) x (n - 6) x (n - 7) … etc.

If 2 letters were the same, the equation would be:

n! image03.png2

And if 3 letters were the same, it would be:

n! image03.png 2 image03.png 3                                                                                                         …etc.

This concludes my coursework, as I have now found how many combinations you can get from an n letter word, even when the word has 2 letters the same, 3 letters the same, 4, or 5 …etc.

- Louise Manly

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

    if any pattern arises: Case Study 1 Results: Number of letters All letters different (ABCD) 1 letter repeated twice (AABC) 2 letters repeated twice (AABB) 1 1 2 2 1 3 6 3 4 24 12 6 - The numbers in red are the amounts of combinations for that case Here we can see a pattern.

  2. Emma's Dilemma

    repeat four times (AAAAA), this is because it is easier to find the possibilities for a word with more repeats, as the number of different combinations decreases. The example I will be using is 'AAAAA' AAAAA AAAAA 1 POSSIBILITY As indicated above there is only 1 possible outcome, and therefore

  1. Emma's Dilemma

    I will use XXAA. XXAA AAXX XAXA AXAX XAAX AXXA I have found 6 arrangements for XXAA. I will now investigate a double letter, triple letter combination. I will use XXXAA XXXAA AAXXX XXAAX AXAXX XXAXA AXXXA XAAXX AXXAX XAXXA XAXAX I have found 10 arrangements for XXXAA I will now investigate a triple letter, triple letter.

  2. Emma's Dilemma

    letters in the name were completely dependant on the number of duplicate letters in that name - hence "the number of different arrangements for the letters in a name = n!/a" a here and indeed from now on being the number of repetitions in a name - this was not the case as can be seen in the later results.


    Lets use the formula that I have created and lets see if it works. 1*2*3*4=24/3=8 My formula does not work, but it will work on a word with 2 letters repeated. Lets see what's wrong with my formula. 2 letters are same, then: 3 letters: 1*2*3/1*2 4 letters: 1*2*3*4/1*2 5

  2. Emma's Dilemma

    Testing and predictions To test if the formula N! is correct I will use it to figure out the number of total arrangements in the name JOE. Prediction: There are 3 letters in the name JOE. So 3! = 3X2X1 = 6 Testing Starting letter J Starting letter O Starting letter E JOE JEO OJE OEJ EJO EOJ Overall Total: 6 My Prediction is correct!

  1. GCSE Mathematics: Emma's Dilemma

    is being divided by Do you notice that x equal the last x multiplied by n? Using this information, I predict that the formula for a word with 4 of the same letter is: a= n!/24 Let's confirm it: Try a four letter word with 4 of the same letter:

  2. Emma's Dilemma.

    UCYL CUYL YLUC LCYU UYCL CLYU YUCL LCUY UYLC CLUY YULC LYCU ULYC CYUL YCUL LYUC ULCY CYLU YCLU There are 24 different combinations here, which prove that my previous results were correct. I shall now work out a formula that lets me find out how many combinations there are

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