• 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

# Investigate all the possible combinations there are of a person's name, using only the letters in their name.

Extracts from this document...

Introduction

Emma’s Dilemma

Introduction

This piece of course work was set to investigate all the possible combinations there are of a person’s name, using only the letters in their name.

For example Joe:

The combinations are

Joe

Jeo

Eoj

Ejo

Oej

Oje

Part 1

Lucy

In this section, I will be exploring all the combinations of the name Lucy and if there is any correlation between the number of combinations and the number of letters in her name.

Possible Combinations:

1. lucy
2. luyc
3. lcuy
4. lcyu
5. lyuc
6. lycu
7. ulcy
8. ulyc
9. uylc
10. uycl
11. ucly
12. ucyl
13. cluy
14. clyu
15. culy
16. cuyl
17. cylu
18. cyul
19. yluc
20. ylcu
21. yucl
22. yulc
23. yclu
24. ycul

Method

Firstly you choose one letters to start with, then change the second letter, for the example of Lucy we would have

Lucy

Lucy ← The U stays the same but the last two letters change, this pattern is repeated.

From

Middle

In this section I will be exploring the possible combinations of a name that includes a double letter.

Possible Combinations:

1. emma
2. emam
3. eamm
4. meam
5. maem
6. mame
7. mema
8. mmea
9. mmae
10. amme
11. amem
12. aemm

From this we can see that there are 12 possible combinations of the name Emma. This could mean that to find the number of combinations in a name with repeated letters, you take the number of cominations in that amount of letters without repeated letters and divide it by to.

For example

24/2 = 12

As Lucy had 24 combination and when adding a double letter the number of combinations were 12.

I will investigate into this further in Part 3

Part 3 – Further Research

Rohan

I know from investigation that Rohan has 120 combinations of his name, and has 5 letters in his name.

There for it is 24 x 5.

Conclusion

The formula for a name with repeated letters is

X!/R! where R= the amount a letter is repeated.

Using this, the word ABCBDB would be

6!/3!

If a name has 2 sets of repeated letters then you simply divide it by the amount of repeated letters. So a name like Hannah would be

6!/2!2! as there are 2 A’s and N’s.

This is true of any word. For example ABACABCBACABA would be

14!/6!4!3!

Also from using ! we can easily work out all the combinations of a name without having to write them all out:

 Number of letters in the word Amount of possible permutations 1 1 2 2 3 6 4 24 5 120 6 720 7 5040 8 40320 9 362880

To test this table we can take 9!

Which is 1x2x 3x4x5x6x7x8x9 which is 362880

Tom Edwards 10CHMY – Emmas Dilemma      Page  of

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

Question Four: A number of X's and a number of Y's are written in a row such as XX.........XXYY.........Y Investigate the number of different arrangements of the letters. Answer: In this final part of this coursework, I will be investigating how the relation ship between X's and Y's affect my rule, and to see if I can find easier ones.

2. ## GCSE Mathematics: Emma's Dilemma

a=n/24=(1 x 2 x 3 x 4)/24=1 The formula works Try a 5 letter word with 4 of the same letter: 11112 11121 11211 ----- 5 arrangements 12111 21111 a=n/24=(1 x 2 x 3 x 4 x 5)/24=5 The formula works This confirms my formula!

1. ## permutations &amp;amp; combinations

ESMTA 57. ESTMA 58. ESTAM 59. ESATM 60. ESAMT 61. ETASM 62. ETAMS 63. ETMSA 64. ETMAS 65. ETSMA 66. ETSAM 67. EATSM 68. EATMS 69. EAMTS 70. EAMST 71. EASMT 72. EASTM 73. SAETM 74. SAEMT 75. SATME 76. SATEM 77. SAMET 78. SAMTE 79. SMATE 80. SMAET 81. SMTEA 82. SMTAE 83. SMETA 84. SMEAT 85.

2. ## To investigate the combination of arrangement of letters in Jeans name and then for ...

This would mean that my initial theory is wrong. Here is the table again with the added information. 4 letters different = 24 combinations 3 letters different = 12 combinations 2 letters different (2&2) = 6 combinations 2 letters different (1&3) = 4 combinations I cannot see an obvious connection with the letters at the moment so I will

1. ## I will find all the different combinations of Emma's name by rearranging the letters. ...

Name # Of Letters # Of Arrangements Jo 2 2 = 2x1 Sam 3 6 = 3x2x1 Lucy 4 24 = 4x3x2x1 From my results, I have found a pattern. In Lucy's name, there are 4 letters and 24 possible arrangements.

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

For instance for Irena there would be 24 for I, 24 r, 24 for e and so on. 120 divided by 5 (number of letters) equals 24. Previously in the 4-letter word, 24 divided by 4 equals 6, the number of possibilities there were for each letter.

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

the same is: n!/2 3 Letters the same 3 letters 4 letters 5 letters AAA AAAB AAABC=4 AABA AAACB=4 Total=1 ABAA AACAB=4 BAAA ACAAB=4 CAAAB=4 Total=4 Total=20 I will now try and find a formula for this pattern. First I will simplify the data by putting it in a table: Number of Letters Combination (C)

2. ## Emma's Dilemma - Rearranging Emma's Name in different permutations

2134---2143, 2143---2431,2413,2314,2341 Step3: We have finished 2 go first, then let's do 3 go ahead. 3124---3142, 3142---3241,3214,3412,3421 Step4: We have finished 3 go ahead, then try 4 4123---4132, 4132---4231,4213,4312,4321 I have listed all the arrangements of 1234, I will use this method so I can arrange the letter which have 4 figures or more.

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