Professional Documents
Culture Documents
7.01 Mathematical Preliminaries
7.01 Mathematical Preliminaries
7.01 Mathematical Preliminaries
01 Mathematical Preliminaries
Questions
1. Prove the existence of an integer that is the sum of two perfect squares.
2. .
List all the possible partitions of .
3. Evaluate in terms of n, .
5. 200 different points on the circumference of a circle are chosen at random. The
circle has centre O, a fixed point A on the circumference, and each point must satisfy
the condition that the radius drawn from O to the point must form an angle of with the
radius AO, where is an integer.
Pi
x⁰
O
Use the pigeonhole principle to show that among the 200 points there must be at least one
pair that, when joined by a straight line, forms a diameter of the circle.
7. How many different even numbers less than 400 000 can be made from the digits 123456,
using each digit exactly once?
9. Eight people stand in a line. One of the people is Anne and another is Ben. How many
ways can the eight people stand side by side so that Anne and Ben are not standing next to
one another?
10.* Four cards labelled A, B, C and D are placed randomly into four boxes also labelled A to D,
one card per box. What is the probability that no card gets placed into a box having the
same label as the card?
Extension
In how many ways can you buy 16 cupcakes from an unlimited supply of 5 different types?
What if you have to have at least one of each type or cupcake?
2.
3.
4. .
5. Because of the requirement that is integer, there are only 360 possible points that could
be chosen. These points form 180 opposite pairs, each of which forms a diameter when the
two points are joined by a straight line. It would therefore be possible to choose 180 points,
each at the end of a different diameter, but the 181st point would have to form a pair with a
point already chosen. Therefore, among the 200 points there must be at least one pair that,
when joined by a straight line, forms a diameter of the circle. In fact there will be 20 such
pairs.
6. We can define S as the set of viewers who watch sport, C as the set who watch comedy
and D as the set who watch drama. We can then represent the information given as follows:
The multiplier of 0.8 applies because only 80% of the viewers watch at least one of the
programme types. That is,
We can then use the inclusion-exclusion principle,
To deduce that
So 6.4% of viewers watch all three types of programme.
1_ _ _ _ 2 1_ _ _ _ 4 1_ _ _ _ 6
2_ _ _ _ 4 2_ _ _ _ 6
3_ _ _ _ 2 3_ _ _ _ 4 3_ _ _ _ 6
Alternatively, we could say that if the first digit is 1 or 3, then the final digit can be 2, 4 or 6
but if the first digit is 2 then the final digit can only be 4 or 6. The solution can then be
represented as .
8.
Then,
(since so )
There are 14 ways in which Anne and Ben can be standing next to each other. If we label
the positions 1 to 8, then they could be in 12, 23, 34, 45, 56, 67, 78 and in either order.
For each one of these 14 ways, the remaining 6 people could be arranged in different
ways.
So the answer is
Boxes A B C D
Cards B A D C These are the three derangements
D A B C possible when card A goes into box B
C A D B as described above.
C D A B
D
B
D
C
D
C
A
A
B
B
C
A
¿
C D A A Again, there are three derangements
B C D A possible when card A goes into box D.
Extension
One way to look at this is as arrangements of 16 O's (cupcakes) and 4 |'s (dividers between the
boxes of cupcakes) so that, for example OOOO||OOOOOO|OOOO|OO means that we buy 4
cupcakes of the first type, none of the second type, 6 of the third type, 4 of the fourth type, and 2 of
the fifth type. So we need to find out how many ways can we can arrange 16 O's and 4 |'s in a line.
We can think of this as the number of ways we can place the 16 O's into the 20 places which is
or = 4845.
If we have to have at least one of each, we can only choose the remaining 11 cupcakes and
arrange them with the 4 |'s in a line. The number of ways we can do this is 15C11 or 15C4 = 1365.