• 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
• Level: GCSE
• Subject: Maths
• Word count: 1875

# Emma's dilemma.

Extracts from this document...

Introduction

Maths CourseworkCharlotte Nellist

We were given the name ‘Emma’ and asked to look at it and see how many different ways the letters could be arranged in.  But ‘Emma’ has a repeat in it; it has two m’s.  I decided to start off with the simpler option by not having any repeats in the words, also I thought I would go through first doing a 2 letter word then 3 and then 4… and then I would put all the information into a table then try and work out repeats.

JO - jo

- oj

SAM - sam                                                  sam

- asm   I put them into a bit more                  sma

- mas   order so it was easier to understand.          ams

- msa   I did this by doing the ‘s’ first                  asm

- ams   then the ‘a’ and then the ‘m’.                  msa

- sma                                                   mas

TONI         – toni                - nito

- toin                - niot

- tion                - ntio   There are 6 different arrangements for each letter.

- tino                - ntoi             So altogether for a 4 letter word there are 24

- tnoi                - noti           different ways.

- tnio                - noit

-------                -------

- onti                - itno

- onit                - iton

- otni                - iotn

- otin                - iont

- oitn                - into

- oint                - inot

KIREN        - kiren                - keinr                 - irenk                - ierkn                - ikern

- kirne                - keirn                - irekn                ---------        - iknre

Middle

---------        ---------        ---------        ---------        ---------

- senail        - slaein                - sielna                - snliae                - sainel

- senali        - slaeni                - sielan                - snliea                - sainle

- senlai        - slaien                - sienal                - snlaie                - saieln

- senlia        - slaine                - sienla                - snlaei                - saienl

- senile        - slanie                - siealn                - snleai                - sailne

- senial        - slanei                - sieanl                - snleia                - sailen

---------        ---------        ---------        ---------        ---------

- sealin        - sleina                - silnae                - sniael                - saneil

- sealni        - sleian                - silnea                - sniale                - saneli

- seailn        - slenai                - silane                - snieal                - sanlie

- seainl        - slenia                - silaen                - sniela                - sanlei

- seanli        - sleani                - silean                - snilea                - sanile

- seanil        - sleain                - silena                - snilae                - saniel

There are 120 different ways of arranging the word ‘selina’ beginning with the letter ‘s’. There are 6 letters in the word, so 6 x 120 = 720. Which is how many ways I predicted it would have.

A formula can be made to predict the number of different combinations for any number of letters in a word.  If the number of letters is n then the formula will be n(n-1)(n-2)…

This works out because there are n possible

Conclusion

A 6-letter word with one letter repeated 3 times has 120 different arrangements. So the formula is correct.

Then I checked that it would work if in a word there were 2 letters repeated twice.

AABB        - aabb

- abab

- abba

- baab

- baba

- bbaa

ABBCC        - abbcc                - bbacc                - bacbc                - bccab                - cbbca

- abcbc                - bbcac                - baccb                - bccba                - cbcab

- abccb                - bbcca                - bcabc                - cacbb                - cbcba

- accbb                - cabbc                 - bcacb                - cbabc                - ccabb

- acbcb                - cabcb                - bcbac                - cbacb                - ccbab

- acbbc                - babcc                - bcbca                - cbbac                - ccbba

 Number of letters Number of arrangements 4 6 5 30

4! = 24

24

6        = 4

The factors of 4 are 2 and 2

Which are both letters repeated twice,

n(n-1)(n-2)(n-3)…

(x1(x-1)(x-2)…*x2(x-1)(x-2)…)

So for a 5-letter word with 2 letters repeated twice the equation will be,

5(5-1)(5-2)(5-3)(5-4)

(2(2-1)*2(2-1))

Or on a calculator,

5!

(2!*2!)        = 30 different arrangements

With all this information the total number of combinations can now be calculated for any word with any number of letters with any number of repeated letters too.  All these formulae have a name, factorial and a notation, n!.

Page

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

# Related GCSE Emma's Dilemma essays

1. ## Emma's Dilemma

I learned this formula form background research I did myself, and have decided to incorporate it in to my work. Factorials can be used, by instead of writing: "No. of letters X ( No. of letters - 1 ) X ( No.

2. ## GCSE maths coursework: Emma's dilemma

12121212 12112122 12122121 12212211 12211212 12112212 12122211 12221112 --------------20 arrangements 12112221 12211122 12221121 12121122 12211221 12221211 12121221 12212112 12222111 2------- so on ------35 arrangement Total arrangement is 70, it works the formula is confirmed This formula can be written as: a=ni/xixi x represent the number of figures of same number

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

of Y's + 1 ) + ( No. of Y's - 2 ) + etc... combinations For example: To find the number of combinations which can be made from using 10 letter Y's and Two X's, can be found by using the following formula: No.

2. ## Johannes Gensfleisch zur Laden zum Gutenberg, or commonly know as Johann Gutenberg, was the ...

(Johannes Gutenberg I) Each letter had a mold, which was made out of equal amounts of metal alloys. The letters would be arranged in words, and sort of locked together in place to form a page. This would then be placed into a printing press, which would cover the letters in ink, and

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

AACBB ABBCA ABCBA ABBAC ABCAB ABACB ABABC ACABB ACBAB ACBBA BAABC BABAC BABCA BAACB BACAB BACBA BBCAA BBACA BBAAC BCAAB BCABA BCBAA CAABB CABAB CABBA CBABA CBAAB CBBAA So looking at the word I can then apply the same rules for this word.

2. ## Investigating the arrangements of letters in words.

Working 6 15 360 15 6!/(2!x4!)=15 7 105 2520 105 7!/(2!x4!)=105 8 840 20160 840 8!/(2!x4!)=840 n letters n n!/(2!x4!) I think the formula is n!/(2!x4!). I'll now predict what the combination is for 9 letter words. 9 7560 181440 7560 9!/(2!x4!)=7560 I will now prove that 9 lettered

1. ## I am doing an investigation into words and their number of combinations. I will ...

However, the pattern is different and doesn't follow n!/a!. I thought that if I focused on n! and took the fact that it was the numerator for granted, I might find a formula more quickly than if I just tried to find any formula that worked.

2. ## Emma's Dilemma

No letters repeated One letter repeated 2? One letter repeated 3? One letter repeated 4? 2 2 1 N/A N/A 3 6 3 1 N/A 4 24 12 4 1 5 120 60 20 5 6 720 360 120 30 7 5040 2520 840 8 40320 20160 6720 From looking at the table of results, I have

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