• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

In this piece of coursework my initial aim is to investigate how many different combinations there are for four letters (e.g. ABCD).

Extracts from this document...


Jeremy Beales                /

Maths Coursework- Matt’s First Theorem

In this piece of coursework my initial aim is to investigate how many different combinations there are for four letters (e.g. ABCD), I also intend to develop this to investigate the way in which by altering the letters to form other kinds of combinations (e.g. ABCC or AAB) the number is affected. Once I have found the general formulae, I will apply these to harder situations and this is what I am aiming to do. I am trying to find the general formulae which can be applied to all situations we set about this by looking at the simplest scenario first i.e. one letter (e.g.A) moving on to harder problems and by the end I hope to be able to find the possible arrangements for any given word. I will do this by using tables and lists of my results to show the possible combinations and make it easy to compare them and to spot the pattern and try and turn this into a general formula. Once the initial

...read more.


One Triple Letter-

3 letters- AAA

4 letters- AAAB




5 letters- AAABC



















No. of letters              3         4         5  

No. of combinations  1         4          20

This gives the formula = n!/3!


If you have a triple letter, then you must divide the n! by 3! because there are 3 repeated letters and so the same will apply as above but in this case there would be three repeats of each combination with triple letters than if there were different letters, e.g. AAAB, if it was ABCD there would be 3! or six times the amount of combinations as there are with ABCD.

This is almost the same formula as above and has only changed in the fact that you have to divide by 3! instead of 2! and this leads me to think that I can easily form a generalised formula, this formula is n!/r! which is true because you need to divide the number of letters by the number of repeated letters because each repeated letter removes 1! options and so three repeated letters removes 3! options .

...read more.


Random Selection of Letters without order

In this process I am going to assume that AB is the same BA, this will obviously reduce the number of possible selections, after writing out the possibilities for 5 different letters and 6 different letters I quickly saw that the number was just divided by two, thus giving the general formula (n(n-1)/2

Development of formula-

1st - n! – Where n = number of letters

2nd - n!/ r! – Where r =number of repeated letters

3rd - n!/ r!xs!xt! Where r= 1st group of repeats s= second group and so on

4th - n!/(n-1)! This an be extended to form the formula n!/(n-r)! – Where r = number of letters selected from n

...read more.

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

See related essaysSee related essays

Related GCSE Emma's Dilemma essays

  1. permutations & combinations

    SMTEA 82. SMTAE 83. SMETA 84. SMEAT 85. STEAM 86. STEMA 87. STMAE 88. STMEA 89. STAME 90. STAEM 91. SEATM 92. SEAMT 93. SETMA 94. SETAM 95. SEMTA 96. SEMAT 97. SMEAT 98. SMETA 99. SMATE 100. SMAET 101. SMTEA 102. SMTAE 103. SAMTE 104. SAMET 105. SAETM 106. SAEMT 107. SATEM 108. SATME 109. SEATM 110.

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

    The reason why I think this is because when the total number of letters that have a double letter in it are being arranged the double letter only counts as if it's one letter. So therefore half of the combinations are reduced compared to the number of combinations with different letters.

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

    of = No. of letters ! combinations ( times a letter X ( times a different letter has been repeated ) has been repeated ) By writing this, you still mean the previous line, but it is now a lot easier to write down, especially if the number of letters exceeds 10.

  2. Emma is playing with arrangements of the letters of her name to see how ...

    I am trying to find a formula to find the number of combinations for any given number of letters.

  1. Two in a line

    = 12 Vertical arrangements follow a similar structure. This grid is 3 x 5 (3 wide and 5 long) There are 2 arrangements for each column (1 less than the width) There are 5 possible columns with the same arrangements (same as the length)

  2. Investigating the arrangements of letters in words.

    n!/2 Working 4 letters 6 24 12 4!/(2!x2)=6 5 letters 30 120 60 5!/(2!x2)=30 6 letters 180 720 360 6!/(2!x2)=180 N letters n n! 2n n!/(2!x2) I think the formula is n!/(2!x2!) I will now test and predict the combination for 7 letters: 7 letters 1260 5040 2520 7!/(2!x2)

  1. To investigate the various arrangements that could be made with different names or words. ...

    This sign is called Factorial. This term is used when the numbers are being consecutively multiplied until the number before "!". This is normally seen as n! "n" is the number of letters in the name. E.g. 5! = 1 x 2 x 3 x 4 x 5 = 120 Here is a table showing what the next few arrangements would be.

  2. Compare and contrast the fictional letters in 'Birdsong' with the real letters written to ...

    He contemplates his feelings of death and his present situation in his letter. The content of the letter gives the reader a clear picture of war life, which engages us to read more. 'Stephen's' letter can be contrasted with the other letters in the chapter.

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