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

GCSE Mathematics: Emma's Dilemma

Extracts from this document...

Introduction

GCSE Mathematics: Emma's Dilemma Emma and Lucy are playing with arrangements of their names. One arrangement of LUCY is L.U.C.Y. Another arrangement is Y.L.C.U. We are investigating the number of different arrangements of Emma and Lucy's names. Then we shall move onto the number of different arrangements of various groups of letters. Firstly, I shall list all the possible combinations for the word "LUCY": LUCY LCUY LYUC LYCU LUYC LCYU UCYL UYCL ULCY ULYC UYLC UCLY CYLU CYUL CULY CUYL CLYU CLUY YCUL YCLU YUCL YULC YLUC YLCU = 24 Combinations I listed all these combinations by using the following method: Step 1 Arrange the listing process into 4 stages: 1 _ _ _ 2 _ _ _ 3 _ _ _ 4 _ _ _ Step 2 You start off with the original word: 1234 Acquire the combinations of the last two numbers first and you end up with 1243. Now that you have 1243, do the last three numbers and try the different possibilities: 1423 1432 1342 1324. Because the number 2 has been the first number of last three numbers, we don't do it again. Step 3 Now that we have listed all the arrangements beginning with 1, we do the list of arrangements with 2 in the beginning: Start off with 2134 and do same thing to it, it will look like this: 2134 2143 2431 2413 2314 2341 Step 4 Now that we have established the different arrangements of 2, we go ahead and do 3 at the beginning: 3124 3142 3241 3214 3412 3421 Step 5 Now that we have established the different arrangements of 3, we go ahead and do 4 at ...read more.

Middle

Try 5 letters: 42213 12234 42231 12243 42123 12324 42132 12342 42321 12423 42312 12432 41223 13224 41232 13242 41322 13422 43122 14223 43212 14232 43221 14322 21234 23124 21243 23142 21324 23214 21342 23241 21423 23421 21421 23412 22134 24123 22143 24132 32412 22314 24231 32421 22341 24213 34122 22413 24312 34212 22431 24321 34221 32241 32214 32142 32124 31422 31242 31224 So the total arrangements are 12 x 5=60 Let's put our results in a table and try to extract a formula from there: Number Of Letters (With 2 of the letters the same) Number Of Combinations 2 1 3 6 4 12 5 60 Which can be re-written as: Number Of Letters (With 2 letters the same) Number Of Combinations 2 1 3 3 x 1 4 4 x 3 x 1 5 5 x 4 x 3 x 1 Let's work out the formula: if n= number of figures a= number of arrangements the formula is a=n!/2 Let's confirm the formula: Number Of Letters (with 2 letters the same) Number Of Combinations 2 2/2=1 It works 3 (1 x 2 x 3) / 2=3 It works 4 (1 x 2 x 3 x 4) / 2=12 It works Now I shall investigate different amounts of letters with different amounts of repeated letters. I shall start off with a four letter word where 3 of the letters are the same. For this I shall use the combination "3331": 3331 3313 3133 1333 - There are 4 combinations. Now let's try a 5 letter word with 3 letters the same: 33312 31233 33321 31323 33123 31332 33132 32331 33231 32313 33213 32133 21333 12333 23133 13233 23313 13323 ...read more.

Conclusion

The formula is confirmed. Conclusion From the investigation above we find out the formula for calculating the number of arrangements, it's a=n!/x! a represent the total arrangements n represent the number of figures of the number ! represents the factorial function. x represent the number of duplicated letters in the word for 2 pairs of the same letter: the formula is a=n!/x!x! for 2 pairs of different duplicated letters of same number in a word: the formula is a=n!/x1!x2! for 3 pairs of same number of duplicated letters in a word: the formula is a=n!/x!x!x! for 3 pairs of a different number of the same letter in a word: The formula is a=n!/x1!x2!x3!. The formula can be also used to find the amount of different arrangements of letters. For example: xxyy the arrangement for this is a=(4 x 3 x 2 x 1)/(2 x 1 x 2 x 1)=6 xxyyy the arrangement for this is a=(5 x 4 x 3 x 2 x 1)/(3 x 2 x 1 x 2 x 1)=10 xxxxxxyyyyyyyyyy The formula for this is: a=n!/x1!x2!=(16 x 15 x 14 x 13 x 12 x 11 x 10 x 9x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1 ) / ( 1 0 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 3 x 2 x 1 x 6 x 5 x 4 x 3 x 2 x 1 ) = 8 0 0 8 The total arrangement is 8008. Using this formula, we can find out the total arrangements of all numbers and letters. Sheroy Zaq (X2) Mrs Whybrow ...read more.

The above preview is unformatted text

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. Maths GCSE Coursework: Emma's Dilemma

    We can see here that when another pair of the same letter comes into the case, the result is exactly half than what it was before the pair was added (shown in bold RED). Why this works Explaining why this works is difficult, so I will use the help of the previous studies to explain.

  2. GCSE Mathematics Coursework - Emma's Dilemma

    case, although it was not the same pattern as was found in names with no repeated letters. I recorded my results in a table. Table showing the number of different arrangements of letters possible in words of different lengths with no repeated letters Number of letters Number of different arrangements

  1. EMMA's Dilemma Emma and Lucy

    112233 121233 123123 131223 132231 112323 121323 123132 131232 132123 112332 121332 123213 131322 132132 ------ 30 arrangements 113223 122133 123231 132321 133122 113232 122313 123312 132312 133212 113322 122331 123321 132213 133221 2------- 3------ so on ------30 arrangements so on --------- 30arrangements The total arrangement is 90, the formular works.

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

    same as for a four letter word, but with an added letter at the beginning. All the letters can be placed at the beginning and we then get a the number of arrangements for a four letter word with each letter at the beginning.

  1. Emma’s Dilemma

    / SL! = A 5! / 4! = 5 This proves the rule to be correct. I then can take this back to single lettered words. Here, the rule still applies. However, we can see that because all the letters are different, it makes no alteration to include the additional division section of the equation.

  2. Emma's Dilemma

    From the formulas that I have found, I have noticed that the number n! is divided by the result of doing factorial with the number of repeated letters. For example, if you want to find the total arrangement of a five-lettered word, which has two repeated letters, you will first

  1. Emma's Dilemma.

    n r a 2-JO NO 2 2-YY YES 1 3-JIM NO 6 3-BBC YES 3 4-LUCY NO 24 4-EMMA YES 12 5-RALPH NO 120 5-DAVID YES 60 OBSERVATIONS The main comparison I noticed between a word with all different letters and a word with 2 of its letters the same,

  2. Emma's dilemma.

    The logic behind factorial is that it is a way of working out the amount of possibilities for different combinations there is going to be. E.G. If you start off with one letter, A, then you Add another letter, B, it has two places it can be placed in to create new combinations.

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