• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  • Level: GCSE
  • Subject: Maths
  • Word count: 1977

Emma is playing with arrangements of the letters of her name to see how many combinations there are.

Extracts from this document...


Year 11 Coursework:

Emma’s Dilemma

Emma is playing with arrangements of the letters of her name to see how many combinations there are.

EMMA                 AEMM                 MMAE                MAEM

EMAM                 AMEM                 MMEA                MEMA

EAMM                 AMME                 MEAM                MAME

I found that there are 12 combinations of the letters in the name Emma. However, I think that the fact that there is a repeated letter in the name has affected the result. I will try another name with no repeated letter to see if it will affect the number of combinations. I will use the name Lucy.

LUCY                  UCYL                   CYLU                  YLUC        

LUYC                  UCLY                   CYUL                  YLCU

LCUY                  ULCY                   CUYL                  YCUL

LCYU                  ULYC                   CULY                  YCLU

LYUC                  UYLC                   CLYU                  YUCL

LYCU                  UYCL                   CLUY                  YULC

I found 24 different combinations, twice as many for Emma. I will try another couple of four-letter names to see if I get the same results. I will try another name with a repeated letter to see if I find 12 combinations.

NINA                  NANI                     AINN                   IANN

NIAN                  NNAI                     ANIN                   INAN

NAIN                  NNIA                     ANNI                   INNA

Like Emma, there are 12 combinations for the name Nina.

To make sure I don’t miss out any combinations or repeat any I use a system.

I start with the name then swap around the last two letters.



I then change the second letter and repeat this.



...read more.


KRYER                EKYRR                 REKYR                 RKRYE

YKERR                YERRK                 YRREK                 YREKR

YKRER                YERKR                 YRRKE                 YRKRE

YKRRE                YEKRR                 YRKER                 YRERK

There are 60 combinations for a five-letter name with one repeated letter.

I will now try a name with two repeated letters I will use the name Hanna.                  

HANNA                              ANNAH                          NANAH                                                          

HANAN                              ANNHA                          NANHA

HAANN                              ANHNA                          NAHNA

HNNAA                              ANHAN                          NAHAN

HNANA                              ANANH                          NAAHN

HNAAN                              ANAHN                          NAANH

                                             AAHNN                          NNAAH

                                             AANHN                          NNAHA

                                             AANNH                          NNHAA

                                             AHNNA                          NHAAN

                                             AHNAN                          NHANA

                                             AHANN                          NHNAA

I have found 30 different combinations for a five-letter name with two repeats.

No Repeats

1 Repeat

2 Repeats

5 Letters




I can see from my table that the pattern for the results for five-letter names is the same. The number of arrangements is halved each time a letter is repeated.

I am trying to find a formula to find the number of combinations for any given number of letters. I will find results for six-letter names to help me find the formula. I predict that there will be 720 combinations for a six-letter name with no repeats. I think this because there are 6 combinations beginning with NIC;

NICOLA                          NICALO                           NICLOA

NICOAL                           NICAOL                          NICLAO

Therefore there will be 6 combinations each for NIL, NIA and NIO.

Eg. NILCAO                      NILACO                        NILOCA

      NILCOA                      NILAOC                         NILOAC etc.

There will therefore be 24 combinations for NI, 24 for NC and so on. Altogether there will be 120 combinations beginning with the letter N.

...read more.


No. of  x’s

No. of combinations


1!   (= 1)




2!   (= 2)




3!   (= 3)




4!   (= 4)



I know that  n!  equals the number of combinations for any word with no


repeated letters and  n!  is for one repeated letter etc. However, I want to


find out the formula for working out the number of combinations for words with letters repeated more than once.


The formula for this could be written as:

        6!           (no.of letters)

                                              3! × 3!                 (no. of x’s > y’s)image04.png


 720  = 20


I will write out all thepossiblecombinations for XXXYYY to check my result.





















My formula worked correctly – I have found 20 possible combinations for XXXYYY.

I can now do a formula for any word with any number of letters and any number of repeats.

For example:

                         For XXYYZZ it would be

6!    image05.png

2! 2! 2!

For XXYZABC it wouldbe


2! 1! 1! 1! 1! 1!image02.png

My overall formula would be:



This can be used to find out the number of combinations for the letters of any word. I would just have to substitute the number of each letter for the letter. So, instead of a!, I would put in the number of times that a appears in the word I was trying to find out the number of combinations for.

For example:

‘Maths’ would be:


1! 1! 1! 1! 1!

Which would equal 120 different combinations.

Whereas ‘classes’ would be:


1! 1! 1! 3! 1!

Which would equal 840 different combinations.

...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. Arrangements for names.

    That's twice as many as EMMA, which has 4 letters and 3 different. I have noticed that with Lucy there are 6 possibilities beginning with each different letter. For instance there are 6 arrangements with Lucy beginning with L, and 6 beginning with u and so on.

  2. Emma's Dilemma

    X 2 ! X 2 ! 8 This is due to the fact that the six different letters can be arranged in any order, and because all of them are different, it dose matter which order they go in. However, with more than one letter repeated more than once, the total number of arrangements is reduced

  1. permutations & combinations

    ESMTA 57. ESTMA 58. ESTAM 59. ESATM 60. ESAMT 61. ETASM 62. ETAMS 63. ETMSA 64. ETMAS 65. ETSMA 66. ETSAM 67. EATSM 68. EATMS 69. EAMTS 70. EAMST 71. EASMT 72. EASTM 73. SAETM 74. SAEMT 75. SATME 76. SATEM 77. SAMET 78. SAMTE 79. SMATE 80. SMAET 81. SMTEA 82. SMTAE 83. SMETA 84. SMEAT 85.

  2. Compare and contrast the fictional letters in 'Birdsong' with the real letters written to ...

    'Tipper' and 'Byrne's' letters were similar. Both showed slight British patriotism. "It's a terrific show...can't wait to let Fritz have it!" 'Byrne's' short letter had "...thumbs-up merry and bright and trusting to the best of luck." This shows positively and to extent liveliness through the tone, which is created by the language.

  1. We are investigating the number of different arrangements of letters.

    According to the formula, I expect the total arrangement for this is a=(1*2*3*4*5)/(3*2*1*2*1)=10 11122 12211 11212 21112 11221 21121 -------10 arrangements 12112 21211 12121 22111 The formular still works. Let's try 7 fig, with 3 same number, and 4 same number.

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

    at the beginning, moving A into the letters that are swapping round, there would be four more lots of 24 arrangements; therefore there would be 120 arrangements in total. From the investigation above, I looked for a pattern relating the number of different letters in the word and the total number of different arrangements.

  1. I will find all the different combinations of Emma's name by rearranging the letters. ...

    First, I will explore names with different letters. I will use the names Jo, Sam, Lucy and Emily. Jo Sam Lucy Emily JO SAM * ??? OJ SMA MSA MAS ASM AMS *Previous results show that Lucy has 24 arrangements.

  2. Find out how many different arrangements of letters there are in a name or ...

    I will now use different names with different numbers of letters and find out how many arrangements there are. I will then try to find a pattern. MO: 1)MO 2) OM RIA: 1)RIA 2)RAI 3)AIR 6)ARI 5)IRA 4)IAR LUCY: 1)LUCY 2)LCYU 3)LUYC 4)LYUC 5)LCUY 6)LYCU 7)UCYL 8)UCLY 9)UYLC 10)UYCL

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