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

# Emma's Dilemma

Extracts from this document...

Introduction

Amy Cotter 11u

Maths Coursework

Investigation:

“Emma’s Dilemma”

Emma’s Dilemma

I am going to investigate the number of different combinations of various groups of letters.

LUCY is a 4 letter word with letters all different. This is the number of combination there can be for LUCY:

LUCY          CLUY                          There are 24 combinations for a 4 letter

LUYC          CLYU                          word that include letters that are all

LCYU          CYLU                          different.

LCUY          CYUL

LYUC          CULY

LYCU          CUYL

ULCY          YLUC

ULYC          YLCU

UYLC          YUCL

UYCL          YULC

UCLY          YCLU

UCYL          YCUL

EMMA is a 4 letter word with 2 letters the same and 2 different. This is the number of combination there can be for EMMA:

EMMA          AEMM                     There are 12 combinations for a 4 letter

EMAM          AMME                     word that includes 2 letters the same and 2

EAMM          MMAE                     different.

MEMA          MMEA

MEAM          MAEM

AMEM          MAME

After investigating to number of combinations there are for the words

Middle

DAEBC

DAECB

DBACE

DBAEC

DBCAE

DBCEA

DBEAC

DBECA

DCABE

DCAEB

DCBAE

DCBEA

DCEAB

DCEBA

DEABC

DEACB

DEBAC

DEBCA

DECAB

DECBA

EABCD

EABDC

EACBD

EACDB

EBACD

EBCDA

EBDAC

EBDCA

ECABD

ECBDA

ECDAB

ECBBA

EDABC

EDACB

EDBAC

EDBCA

EDCAB

EDCBA

Now I will do the same again but include 2 letters that are the same in each word, starting with the simplest possible, 2 letters:

AA                                               There is 1 combination for 2 letters that

are both the same.

AAB                                            There are 3 combinations for 3 letters that

ABA                                            include 2 letters the same and 1

BAA                                            different.

AABC          BAAC                       There are 12 combinations for 4 letters

AACB          BACA                       that include 2 letters the same and 2

ABAC          BCAA                       different.

ABCA          CAAB

ACAB          CABA

ACBA          CBAA

There are 60 combinations for 5 letters that include 2 the same and 3 different.

AABCD

AABDC

AACBD

AACDB

ABACD

ABCDA

ABDAC

ABDCA

ACABD

ACBDA

ACDAB

ACDBA

BAACD

BACDA

BCDAA

BDCAA

BDACA

BDAAC

CAABD

CABDA

CBDAA

CDAAB

CDABA

CDBAA

DAABC

DAACB

DABAC

DABCA

DACAB

DACBA

DBAAC

DBACA

DBCAA

DCAAB

DCABA

DCBAA

From the previous information, I can form this table which may later help me in finding a formula. In the table below, “s” stands for the number of letters that are the same as each other. There can be more than one number for “s”, for example in this amount of letters:

AABBCC

There are 2 As, 2 Bs and 2 Cs.

Conclusion

span> and 3different:

AAABCD

AAABDC

AAACBD

AAACDB

AABACD

AABCDA

AABDAC

AABDCA

AACABD

AACBDA

AACDAB

AACDBA

ABAACD

ABACDA

ABCDAA

ABDAAC

ABDACA

ABDCAA

ACAABD

ACABDA

ACBDAA

ACDAAB

ACDABA

ACDBAA

BAAACD

BAACDA

BACDAA

BCDAAA

BDAAAC

BDAACA

BDACAA

BDCAAA

CAAABD

CAABDA

CABDAA

CBDAAA

CDAAAB

CDAABA

CDABAA

CDBAAA

DAAABC

DAAACB

DAABAC

DAABCA

DAACAB

DAACBA

DABAAC

DABACA

DABCAA

DACAAB

DACABA

DACBAA

DBAAAC

DBAACA

DBACAA

DBCAAA

DCAAAB

DCAABA

DCABAA

DCBAAA

From the previous information, I can form this table which may later help me in finding a formula:

Table 3:

 Number of Letters (n) s Number of combinations (c) 3 3 1 4 3 4 5 3 20 6 3 120

From tables 1 and 2, I can devise this formula:

n! ÷ s! = c

where s is the number of letters that are the same. s can does not have to be one number, for example in this group of letters:

AABBCC

s would be 2, 2 and 2. When there is more than 1 value for s you multiply them. So using n! ÷ s! = c, I predict that the number ofcombinations for AABBCC is:

n! ÷ s! = c

= 6! ÷ 2! x 2! x 2!

= 720 ÷ 2 x 2 x 2

= 720 ÷ 8

= 90

Here I have tested my prediction that there will be 90 combinations for AABBCC:

AABBCC

AABCBC

AABCCB

AACCBB

AACBCB

AACBBC

ABABCC

ABACBC

ABACCB

ABBACC

ABBCAC

ABBCCA

ABCABC

ABCACB

ABCBAC

ABCBCA

ABCCAB

ABCCBA

ACACBB

ACABCB

ACABBC

ACCABB

ACCBAB

ACCBBA

ACBACB

ACBABC

ACBCAB

ACBCBA

ACBBAC

ACBBCA

BAABCC

BAACBC

BAACCB

BABACC

BABCAC

BABCCA

BACABC

BACACB

BACBAC

BACBCA

BACCAB

BACCBA

BBAACC

BBACAC

BBACCA

BBCAAC

BBCACA

BBCCAA

BCCBAA

BCCABA

BCCAAB

BCBCAA

BCBACA

BCBAAC

BCACBA

BCACAB

BCABCA

BCABAC

BCAACB

BCAABC

CAACBB

CAABCB

CAABBC

CACABB

CACBAB

CACBBA

CABACB

CABABC

CABCAB

CABCBA

CABBAC

CABBCA

CBBCAA

CBBACA

CBBAAC

CBCBAA

CBCABA

CBCAAB

CBABCA

CBABAC

CBACBA

CBACAB

CBAABC

CBAACB

CCAABB

CCABAB

CCABBA

CCBAAB

CCBABA

CCBBAA

This proves my prediction correct, because there are 90 combinations for AABBCC.

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

Using this methodical method is ok for words such as Lucy and Emma, but in another case such as a six-letter word, it would take very long and be extremely inconvenient. Therefore, a method must be found to make this process quicker and easier.

2. ## Emma's dilemma

First of all, I am going to consider words or names with all letters different. 1. A=1 Arrangement 2. AB=2 arrangements 3. ABC BAC CAB ACB BCA CAB =Six arrangements for three different letter word C B A B C There are three letters all together and here I have

1. ## GCSE Mathematics: Emma's Dilemma

Using this information, we can construct a formula. Let "a" represent the number of arrangements "n" represent the number of figures "x" represent the number of duplicated letters The formula will be a=n!/x! (! Cannot be cancelled out) Now I shall investigate what would happen if a word has 2 pairs of the same letter: Let's use a 4 letter word.

2. ## Emmas dilemma

I am now going to look at finding a formula for 2 letters the same in a name because the formula must be based on the same principle as the one for all letters different, I am going to start

1. ## Emma Dilemma

If you look at my table then you will b able to see that names with different letters is double names with 2 letters. This breakthrough will help to speed up the process of working out the combinations, I can now work out the answer for all different letters and

2. ## Emma's Dilemma

N! = N � (N-1) � (N-2) � (N-3) � ... � 3 � 2 � 1 In this case N is a positive integer. Factorial is introduced as the number of ways that an original set can be ordered. For example, if an original set contains 3 items {A, B, C}, then the number

1. ## Emma&amp;amp;#146;s Dilemma

I decided just to look at the arrangements beginning with the first letter of J and then use my rule in order to find the total number more quickly.

2. ## Emma's Dilemma

letter "L" LUCY LUYC LYUC LYCU LCYU LCUY Starting with letter "U" ULCY ULYC UYLC UYCL UCYL UCLY Total: 6 arrangements Total: 6 arrangements Starting with letter "C" CLUY CLYU CYLU CYUL CUYL CULY Starting with letter "Y" YLUC YLCU YCLU YCUL YUCL YULC Total: 6 arrangements Total: 6 arrangements

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