1, 2, 3, 6 2, 3, 5, 6
1, 2, 4, 5 2, 4, 5, 6
1, 2, 4, 6
1, 2, 5, 6
1, 3, 4, 5
1, 3, 4, 6
1, 3, 5, 6
1, 4, 5, 6
In total there are 15 possible combinations.
The reason why shading 4 red squares and shading 2 red squares is the same is because by shading 4 red squares, we leave 2 white squares remaining. Therefore by shading 2 red squares, we leave 4 white squares remaining. This is why both 2 red squares and 4 red squares give us the same number of possible combinations.
I therefore predict that when five red squares are shaded there will be 6 possible combinations. This is because by shading five red squares, 1 white square is remaining, and is interchangeable for the 1 red square in the first example.
With 5 red squares shaded:
Possible combinations: 1, 2, 3, 4, 5 2, 3, 4, 5, 6
1, 2, 3, 4, 6
1, 2, 3, 5, 6
1, 2, 4, 5, 6
1, 3, 4, 5, 6
In total there are 6 possible combinations.
Now let’s label the possible variable with letters:
Number of colours c
Number of squares in rectangle n
Number of squares shaded s
Remaining number of squares r
It is now possible to see if there are any connections or formulae connecting the set of answers for the number of combinations with separate colours and the number of combinations with the same colour.
With 6 squares:
s 1 2 3 4 5 6
c (sep. colours) 6 30 120 360 720 720
c (same colour) 6 15 20 15 6 1
Let’s see, how many more combinations there are with separate colours than there are with the same colours.
Having divided, the number of combinations with separate colours by the number of combinations with the same colour we obtain this row of values: -
1 2 6 24 120 720
At first glance, there does not appear to be any pattern amongst these values. However, if we use an inductive definition, we obtain:
T = (n + 1) T
Also, the results for the colour being the same are symmetrical. On looking at the data, it would be sensible to predict that when s = 0, c (separate colours) will be 1.
Let’s prove this prediction.
From these two diagrams, it is simple to see that shading all 6 red squares is the same as leaving all the squares white.
To find the number of combinations using separate colours: -
6 30 120 360 720 720
Once again on first glance of these values, it does not appear to have a set pattern. However by thinking carefully how the values were achieved in the first place, it is possible to find one.
For example: When we shaded 1 square there were 6 combinations
When we shaded 2 squares there were 6 × 5 combinations
When we shaded 3 squares there were 6 × 5 × 4 combinations
When we shaded 4 squares there were 6 × 5 × 4 × 3 combinations
From this pattern, we can correctly deduce that the formula will included a factorial sign. This means that a value such as 6 factorial will be multiplied by every whole number integer below it.
6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
Because the value for every number of shaded squares begins with 6 x, the formula must contain 6!.
For the remaining squares
1 = 1!
2 = 2!
6 = 3!
24 = 4!
120 = 5!
720 = 6!
Therefore the formula to find the number of combinations using separate colours is: -
However, r = n – s. Therefore the overall formula is: -
To find the number of combinations using the same colour: -
6 15 20 15 6 1
The formula for the number of combinations using different colours is
This gives us the values: 6, 30 120, 360, 720, 720. To find how the two sets of data are related, we can divide one by the other to get a new row of values.
gives us: -
s 1 2 3 4 5 6
c (sep. colours) 6 30 120 360 720 720
c (same colours) 6 15 20 15 6 1
÷ (d) 1 2 6 24 120 720
If we look at s and d closely, it is true to deduce that: -
d = s!
This is because when the same colours are used, for example when 3 squares are shaded, the following diagram only counts as one combination (1, 2, 3)
whereas when different colours are used, using 3 squares as an example again, this counts as 6 ways, or n! more ways. (1, 2, 3
1, 3, 2
2, 1, 3
2, 3, 1
3, 2, 1
3, 1, 2)
Therefore, the overall formula is
When the order that the values appear are relevant to the problem, this is called a
PERMUTATION
For example, when different colours are used, the number of ways that three squares can be arranged is relevant. Therefore, this would be classed as an example of a permutation.
However, when the same colour is used, the number of ways that three squares can be arranged is irrelevant. Therefore, this example would be classed as a combination.
The sign used for permutations is: .
= The number of ways of arranging 4 squares taken from a 7 square grid.
It can also be written as: -
7 × 6 × 5 × 4
Therefore the answer is 180
Unfortunately, this formula does not work for combinations.
The sign used for combinations is:
= The number of ways that 4 squares of the same colour can be arranged in a 7 square grid when the order is irrelevant.
Therefore the answer is 35.
Now, given any number of squares and any number of squares to shade in, a formula can be used to solve the number of combinations.
For the different colours: or
For the same colour: or
Let’s use some examples, in which these formulae can come into use.
Problem: From a group of 10 people, 4 are to be chosen to serve on a committee.
In how many ways can the committee be chosen?
Solution:
The order in which the committee are chosen is irrelevant, so
the sign we use is
n = number of people chosen
r = number of people altogether
Therefore we use = 210
Alternatively we could use
n= 10
s = 4
Problem 2: A committee of 4 is chosen at random from 5 women and 6 men
- How many ways can the committee be chosen when
- There are no restrictions?
- There must be more men than women
(b) Find the probability that the committee contains only one man.
Solution (a) (I)
There are 11 people altogether. The order that the team is irrelevant so
we use the sign
Therefore =
= 330 ways with no restrictions
(II)
If there must be more boys, there must be either 3 boys or 4 boys.
Number of ways of choosing 3 men and 1 girl =
woman
= 20 × 5
= 100
Number of ways of choosing 4 men =
= 6! ÷ 4! 2!
= 15
Therefore the number of ways of choosing if there are more men
= 100 + 15 = 115
(b)
The probability space S = (all possible groups of 4) and n (S) = 330
Let Y = the event of 1 man being chosen
n(Y) = (If one man is chosen, 3 woman must be chosen)
= 6 × 10
= 60
So P (Y) =
=
=
Therefore the probability that the team contains only one man is
Problem 3 In the National Lottery, there are 49 balls altogether. 6 are drawn at random. What is the probability of choosing all 6 balls correctly?
Solution As the order that the numbers are chosen is irrelevant, the correct
formula to use would be .
Let Y = the probability of choosing all 6 balls correctly
So, Y =
=
= 13983816.
However, this is the amount of possible outcomes of the 49 numbers.
The probability of winning the lottery is
Now, let’s expand the problem further.
What results would we obtain if the number of squares in the grid are kept constant, but different colours are used alongside similar colours?
For 1 blue and 2 reds: We will start with this combination because we already know that 1 blue and 1 red gives us 30 combinations
It is possible to see that counts as 3 possible combinations.
They are:
However, when 3 separate colours were used, it was possible to see that counted as 6 possible combinations.
They were:
This would also be true when there are 6 squares in the grid. There will always be half the number of combinations when we use one different colour and two the same.
When 3 separate colours were used, there were 6 × 5 × 4 = 120 combinations. Therefore when 1 blue and 2 reds are used, there will be 60 combinations.
What would happen if we were to use 3 reds and 1 blue?
The number of combinations would be 60 again. This is because shading three squares red and leaving 2 white, is the same as shading 2 red and leaving 3 white.
=
What would happen if we were to use 4 reds and 1 blue?
There will be 30 combinations. This is because shading 1 blue and 4 reds, leaving 1 remaining white square, is the same as shading 1 blue and 1 red, leaving 4 remaining white squares.
=
I predict that when 1 blue square and 5 reds are used, there will be 6 combinations. This is because shading 1 blue and 5 red, leaving no white squares remaining, is the same as shading 1 blue, no reds, leaving 5 squares remaining.
=
As the results are symmetrical, this also justifies the facts that 1 blue and 5 red will have 6 possible combinations.
Let’s compare the results for combinations using different colours, with the above results.
1 blue, 0 red 1 blue, 1 red 1 blue, 2 red 1 blue, 3 red 1 blue, 4 red 1 blue, 5 red
d1 c 6 30 60 60 30 6
s 1 2 3 4 5 6
d2 c 6 30 120 360 720 720
s = number of colours used
c = number of combinations
d1 = 1st set of data
d2 = 2nd set of data
On comparing the two sets of results it is correct to state that by dividing d2 by d1, we obtain the values: -
1 1 2 6 24 120
or
0! 1! 2! 3! 4! 5!
This shows that to get from the number of combinations using different squares to the number of combinations when using one different colour and many of the same colour, we have to divide by the number of red squares factorial (in this case).
Therefore it is possible to conclude that: -
The number of ways of arranging in a line n objects, of which p are alike, is
However, if another colour is added into the grid, the number of ways of arranging in a line n objects of which p of one type are alike, q of another type are alike, r of another type are alike and so on, is
Here are some examples of where this formula may come in use: -
Problem 4: Using the word MATHEMATICS, how many ways can the letters be arranged?
Solution: In the word MATHEMATICS, there are: -
11 letters and M occurs twice
A occurs twice
T occurs twice
Therefore, the number of ways that the letters can be arranged
=
=
= There are 4989600 ways of arranging the letters from the word MATHEMATICS.
Problem 5: Still using the word MATHEMATICS, what is the probability that having rearranged the letters once, the combination begins with MM?
Solution: The probability space S = (arrangements of MATHEMATICS)
N(S) = 4989600
Let Y be the event “the arrangement begins with MM”.
If this happens, we must be left with MMxxxxxxxxx. There is only one way that MM can be arranged. Therefore the remaining 9 letters can be arranged in = 90720 ways.
Therefore n(Y) = 90720
P(Y) =
=
Therefore the probability that the arrangement begins with MM is
In conclusion to my investigation, I have explained why and how many formulae can be related to this particular problem. I managed to find patterns, test them and explain why they worked, which is what I set out to do.
Matthew Arnold