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

# Emma Dilemma

Extracts from this document...

Introduction

Emma Dilemma

## I have been asked to look at people’s names and find the number of combinations to write them. I will look at names with 2+ letters.  I have also been asked to look at names with 2+ letters the same and find the combinations of them too.  I will try to find a pattern between them and make formulae for any of number letters.

To find out the number of combinations at the beginning I will find all the combinations with one letter at the start and then with the next letter at the front.  This is a systematic way of producing the answers and will make it much easier.  For example; if was using Lucy I would do all the combinations with L at the front and these are LUCY, LCUY, LCYU, LUYC, LYCU and LYUC I would then find the combinations with U at the beginning, these combinations are; UCLY, ULYC, UYCL, UYLC, UCYL and UCLY. As you can see this a good and simple way of finding the answer but is very long winded and would take along time to complete the longer names. So I will use a faster way to reach the answer.

Middle

20

5

6

720

360

240

30

7

5040

2520

840

210

## A name with 3 letters different

MAT, MTA

There are 2 combinations with M at the front.

2x3=6.  There are 6 combinations altogether.

3 letters with 2 letters the same

ANA, AAN

NAA

There are 3 combinations altogether, half as many as 3 different letters the same.  I can now add this data to the table.

I can work out a name with 2 letters different and a name with letters and 2 letters the same without writing them down.

I have found a pattern between names with all different letters and the names with 2 letters the same.  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 now that all I have to do is half that answer and will reach the answer for 2 letters the same.

Now I need to try and find a pattern to work out what the combinations are of whatever name with any number of letters, but first I need to do 5 letters the same and 5 letter with 2 the same.

5 letters with 2 letters the same

SCOTT, SCTOT, SCTTO, SOCTT, SOTCT, SOTTC, STOCT, STCOT, STTOC, STTCO, STOTC, STCTO

12X5=60

There are 60 combinations.

Conclusion

After working out all the formulas for words with all different letters, 2 letters, 3 letters and 4 letters the same I have spotted a pattern between their formulas.  To show this pattern if you look at the formulae for a name 2 letters the same, which is n! / 2 you have to divide n! by the number of letters the same factorial. So you could write it n! / 2! which is the same as n! / (2x1) This pattern works for every formulae.  For a name with 3 letters the same the formulae is n! / 6 which is the same as n! / 3! Which is the same as n! / (3x2x1).  This will help with the overall formulae. If we call the bottom factorial x. The formulae becomes n! / x! x= the number of letters the same (so for 2 letters the same it would be 2! and for 3 letters he same it would be 3! etc…).

The overall formula is n! / x!.

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.

Total Letters (all different) Number of Arrangements 1 1 2 2 3 6 4 24 5 120 6 720 So now that I've explained the pattern of general x lettered words, what do I do if there are repeat letters?

2. ## Emma's Dilemma

I have no evidence from previous questions to determine how this factor will affect the number of arrangements, so this will be the hardest section of this question to get precise results for. This is due to the face I have no rule for working the total number of arrangements

1. ## permutations &amp;amp; combinations

This means 5! Divided by 3! Gives this answer. It basically means 5*4*3*2*1/3*2*1. This formula applies for any word with repetitive letters of the same letter: N! / R! N denotes the number of letters and R denotes the number of repetitive letters.

2. ## EMMA'S DILEMMA

Repeated or no repeated. Number of Letters No Letters Repeated Same Letter Repeated 2x Same letter Repeated 3x Same letters Repeated 4x Same Letters Repeated 5x 3 6 3 1 0 0 4 24 12 4 1 0

1. ## Emma's Dilemma

When the third letter is being placed, there are only two places in which it can be placed, and the final letter must fill the final space. In the formula, we start with the number four as there are

2. ## Emma's Dilemma

LIPUAE LIAPEU LIAPUE LIAUPE LIAUEP LIAEPU LIAEUP LIEPAU LIAPUA LIEAPU LIEAUP LIEUAP LIEUPA LEPAUI LEPAIU LEPIAU LEPIUA LEPUIA LEPUAI LEAPUI LEAPIU LEAIPU LEAIUP LEAUPI LEAUIP LEUPAI LEUPIA LEUIPA LEUIAP LEUAPI LEUAIP LEIPAU LEIPUA LEIAPU LEIAUP LEIUPA LEIUAP IPAULE IPAUEL IPAELU IPAEUL IPALEU IPALUE IPUALE IPUAEL IPULAE IPULEA IPUELA IPUEAL IPLAUE

1. ## Emma's Dilemma.

3 letters 2 different Arrangements of lee 1) lee 2) ele 3) eel There are 3 combinations of lee and now I can put my results up to a four lettered word, into a table to see if there is any trends.

2. ## Emma's Dilemma.

observations I should be able to predict a when n is 5 having different letters. I shall use the name Ralph. Prediction for Ralph I can predict a for the name Ralph by looking at my observations from the table above.

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