• 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

# Emmas dilemma

Extracts from this document...

Introduction

Investigation

I am first going to write out all the combinations for the name Emma.

emma

eamm

emam

meam

maem

mmea

mmae

mema

mame

amme

aemm

amem

This proves that if a name has the same arrangements of letters they will have the same total number of different combinations. However, this does not give me sufficient information to develop a formula. I am now going to look at names with 2 letters the same like Emma, but with a different total number of letters.

I am going to look at all the combinations for the name Lucy.

Lucy has 24 different combinations. This means that all names with 4 different letters will have a total of 24 different combinations. I am now going to look at different names with different numbers of letters.

Middle

resio

resoi

reiso

reios

reois

reosi

This means that I can work out the total number of combination by factorial notation.

I realised this because if I could find the total number of combinations by multiplying the total number of letters by the previous number of combinations it was the same as multiplying the total number of letters by its previous consecutive numbers Factorial Notation.

 All letters Different Name Number of Letters Number of Combinations Jo 2 1 x 2 = 2 2 = 2 x 1 Ian 3 2 x3 = 6 6 = 3 x 2 x 1 Lucy 4 6 x 4 = 24 24 = 4 x 3 x 2 x 1 Rosie 5 24 x 5 = 120 120 = 5 x 4 x 3 x 2 x 1

This means when a name has all letters different with any amount of total letters, I can work out the total number of combinations by using this formula.

Number of combinations = Total number of letters Factorial

C = t !

Ian

Total number of letters = 3

C = 3 !

3 ! = 3 x 2 x 1

3 ! = 6

C = 6

Conclusion

 Name Total number of letters Total number of letters factorial (B) Total combinations (A) Difference between A and B Nn 2 2 1 1 Ann 3 6 3 3 Emma 4 24 12 12 Jenny 5 120 ??? ???

The difference between the total number of combinations and the total number of letters factorial is always total number of letters factorial divided by 2.

Therefore the formulae for the total number of combinations when 2 letters are the same is:

Combinations = total number of letters factorial / 2

C = t ! / 2

For Emma

C = 4 ! / 2

C = 12

This means I can predict the total amount of combinations for the name Jenny.

Combinations = total number of letters factorial / 2

Combinations = 5 ! / 2

Combinations = 60

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

that there were 6 combinations beginning with each of the letters in the word I predict that there will be 120 arrangements for qlucy, 24 for q, 24 for l, 24 for u; and so on. 120 divided by 6 (number of letters)

2. ## Emma's Dilemma

This formula is shown below: No. of = No. of letters ! combinations ( no. of times a letter X ( no. of times a letter has been repeated ) ! different has been repeated ) ! As you can see, the factorial symbol has been added to the ends of each part of this equation.

1. ## Maths GCSE Coursework: Emma's Dilemma

name Emma, but as we are treating them as two separate letters, we can see that there are many duplicates in this table. Currently there are 24 combinations, the same as Lucy, but now we will eliminate the duplicates, leaving us with all the real combinations of Emma: E M

2. ## GCSE Mathematics Coursework - Emma's Dilemma

arrangements 1 1 2 2 3 6 4 24 5 120 6 720 7 5040 8 40320 9 362880 10 3628800 I then investigated more names, which had repeated letters, and found that there were fewer arrangements of letters. There also appeared to be a pattern involving factorials in this

1. ## In this piece of coursework I will investigate how many times and ways I ...

=1 combination. The reason why you divide by 3! is because the total number of letters that are the same is three, in the three letters. The factorial nth term formula is that you divide the total number of letters by the number of letters that are the same.

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

YX 2 One X and Two Y's: XYY Total: YXY 3 YYX One X and Three Y's: XYYY YXYY Total: YYXY 4 YYYX One X and Four Y's: XYYYY YXYYY Total: YYXYY 5 YYYXY YYYYX One X and Five Y's: XYYYYY YXYYYY YYXYYY Total: YYYXYY 6 YYYYXY YYYYYX Results for One X and No.

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

This is known as increasing at a factorial rate. Factorials can be written in short with the factorial number followed by an exclamation mark ( ! ). For example four factorial would be expressed as ' 4 ! '. The factorial of the total number of different arrangements (y)

2. ## Emma's dilemma The different ways of arranging letters for Emma's name

Or 10 would be 10!=10x9x8x7x6x5x4x3x2x1=3628800 For me the easiest way to rite out all the combinations by hand is to say I had 4 letters ABCD I would change the last 3 letters and keep the first one the same using N factorial I can tell that there will b 6 different combinations for them last 3 numbers (3x2x1=6)

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