• 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: 2064

Emma's Dilemma

Extracts from this document...

Introduction

Maths Coursework – Emma’s Dilemma

Emma’s Dilemma

Plan

I am investigating the number of different arrangements there will be in different types of names. Some names I will investigate on will have no identical letters such as LUCY. Some will have a pair of identical letters such as EMMA. Some names will have different quantities of letters such as AMMIE, JOE and ANNE.

Firstly, I’ll produce a method which will help me figure out the different arrangements in the name EMMA and LUCY without using any formulas. Using this method I’ll test all my predictions.

I’ll create formulas for different types of names. Examples are names with no identical letters, a pair or more identical letters and names that have 2 different groups of identical letters

Throughout the investigation I will devise different formulas for working out different types of names. By using one of these formulas I’ll figure out the total number of arrangements of the letters XX……XXYY…….Y.

To start of the investigation I have to find the different arrangements of letters in the name EMMA and LUCY without the use of any types of formulas. Therefore, I have developed my own method.

Method

  1. Write the name in its original format. In this case it will be EMMA or LUCY.
...read more.

Middle

JOE= 3X(2X1)= 6

JOHN= 4X(3X2X1) = 24

By looking at this pattern the arrangements of a 5-letter word will be = 5X(4X3X2X1) = 120

A 6 letter word with no identical letters would equal = 6X(5X4X3X2X1) = 720

These type of sequences are called number FACTORIALS, which are represented by the ! Button on the scientific calculator.

So the formula for calculating the number of different arrangements in a word with no identical letters is:

A=N!

A = total number of arrangements

N = the number of letters in the word.

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!

What if a name had a pair of identical letters

From the name EMMA, I already know a 4 letter word with a pair (2 identical letters) of identical letters can be arranged 12 times.

To make this theory correct I will investigate the number of arrangements there will be in the name ANNE.

Starting letter “A”

Starting letter “N”

Starting letter “E”

ANNE

ANEN

AENN

NANE

NAEN

NEAN

NENA

NNEA

NNAE

EANN

ENAN

ENNA

Total: 3

Total : 6

Total: 3

Overall total: 12

Arrangements in AMMIE’s name

Starting Letter “A”

Starting Letter “M”

Starting Letter “I”

Starting Letter “E”

AMMIE

AMMEI

AMIME

AMIEM

AMEMI

AMEIM

AIMME

AIMEM

AIEMM

AEMMI

AEMIM

AEIMM

MAMIE

MAMEI

MAIME

MAIEM

MAEMI

MAEMA

MMAIE

MMAEI

MMIAE

MMIEA

MMEAI

MMEIA

MIAME

MIAEM

MIMAE

MIMEA

MIEMA

MIEAM

MEAMI

MEAIM

MEMIA

MEMAI

MEIAM

MEIMA

IAMME

IAMEM

IAEMM

IMAME

IMAEM

IMMAE

IMMEA

IMEAM

IMEMA

IEAMM

IEMAM

IEMMA

EMMAI

EMMIA

EMAMI

EMAIM

EMIMA

EMIAM

EAMMI

EAMIM

EAIMM

EIAMM

EIMAM

EIMMA

Total: 12

Total: 24

Total: 12

Total: 12

Overall Total: 12X3+24= 60

...read more.

Conclusion

There are many ambiguous answers I got through my investigation.

Firstly, I tried the formula; A=N!/X! on the name Lucy. Since there wasn’t any identical letters in the name, I substituted X for 0 which gave me the whole answer of 0. This gave me the idea that the A=N!/X! only suitable for words with 2 identical letters.

Secondly, I tried the same formula for the rows; XX……XXYY…….Y, I got the equation of 20!/10!, which gave me the ambiguous answer of 670442572800. This made me realise I was wrong so I created a new formula to help me figure this row out.


...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 am going to do this by experimenting with combinations of different amounts of letters, and see if any pattern emerges. I will use 1, 2, 3 and 4 letters, and put the results in a table. 1 letter: A A: 1 combination (1x1)

  2. Emma's Dilemma

    this means number of letters factorise divided by the number of repeated letters. I am dividing by number of repeated letters factorised because that way gives me the results that I need. I have tested this formula on all the names I done before as well and I have got all of the answers correct using this formula.

  1. Emma's Dilemma.

    D A YDNYA N A D YDNAY N D YDANY M A D N YDAYN N A YMDNA D A N YMDAN I will now investigate word with two or more letters the same. AA AA Can only be arranged as AA ANN ANN NAN NNA ANN can be arranged

  2. To investigate the various arrangements that could be made with different names or words. ...

    This sign is called Factorial. This term is used when the numbers are being consecutively multiplied until the number before "!". This is normally seen as n! "n" is the number of letters in the name. E.g. 5! = 1 x 2 x 3 x 4 x 5 = 120 Here is a table showing what the next few arrangements would be.

  1. Emma's dilemma.

    1. JJJJ Number of arrangments = 1 1. ASSSS 2. SASSS 3. SSASS 4. SSSAS 5. SSSSA Number of arrangments = 5 Table to show all of the number of arrangments with different number of letters, and different numbers of letters the same. 1 Same 2 Same 3 Same 4 Same 1 Letter 1 0 0 0 2

  2. Emma’s Dilemma.

    Y C L 13 3 1 2 4 C L U Y 14 3 1 4 2 C L Y U 15 3 2 1 4 C U L Y 16 3 2 4 1 C U Y L 17 3 4 1 2 C Y L U 18 3

  1. Emma’s Dilemma

    PROOF G E M M A* GEMMA GAMME GAMEM GEMAM GAEMM GEAMM GMMEA GMMAE GMEMA GMAME GMEAM GMAEM So with the 3 starting letters which are not an 'M' there is 12 arrangements. Therefore 3 x 12 = 36 arrangements.

  2. Emma’s Dilemma

    1 3 1 1 2 1 3 2 3 1 1 1 2 3 1 3 1 1 2 1 3 1 2 3 1 2 1 1 3 2 1 3 2 1 1 2 factors, 1 repetition = 1 arrangements = (1 x 2) / 2 = 2!

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