• 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

    SAEMT 107. SATEM 108. SATME 109. SEATM 110. SEAMT 111. SEMTA 112. SEMAT 113. SETMA 114. SETAM 115. STAME 116. STAEM 117. STEMA 118. STEAM 119. STMAE 120. STMEA We have investigated the three, four and five letter words. From this we can deduce the different variations for different letter words.

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

    The reader can recognise more excitement and even hope in the other characters' letters. Their letter's contain the information that the characters are going to attack and their warm wishes to their family back home, making the content of the letters seem a lot more personal.

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

    ( See later ). For example For 6 letters, all different, there are "6 X 5 X 4 X 3 X 2 X 1"arrangements. For 6 letters, 1 repeated three times, there are "6 X 5 X 4 X 3 X 2 X 1"arrangements.

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

    is: n! 2 Letters the same 2 letters 3 letters 4 letters AA AAB AABC=3 ABA AACB=3 Total=1 BAA ACAB=3 CAAB=3 Total=3 Total=12 I will now try and find a formula for this pattern by putting all the data in a table to make it easier to understand and observe: Number of letters Combination (C)

  1. Emma’s Dilemma.

    for names with no repeating letters, I found that this time, instead of only two times, they were six times smaller. I continued in the same fashion for names with even more repeating letters and found that the values were all factors of values from names with no repeating values:

  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. Emma is playing with arrangements of the letters of her name to see how ...

    I will now repeat all my workings for five-letter names to see if the results follow the same pattern. I will start with a five-letter name with no repeated letters. EMILY EILYM ELMYI EYMLI EMIYL EILMY ELMIY EYMIL EMYLI EIMYL ELIYM EYILM EMYIL EIMLY ELIMY EYIML EMLYI EIYML ELYMI EYLMI

  2. Two in a line

    multiplied by the width. I.e., (L - 1) x W = W(L-1) In the example above W = 3 and L = 5 giving, 3 x (5 - 1)

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