Solutions:Maths HL 2007 Paper 2
From ZuluNotes - Free Leaving Cert Notes
Solution to the 2007 Higher Level Mathematics Paper 2
Contents |
Section A
Question 1
(a)
1(a)![]()
(b)
(i)
| centre | centre |
distance between centres circles touch internally
(ii)
point of contact is from
in direction of
1(b)(ii)![]()
(c)Draw triangle with sides r, 4(half of 8) and 3 (distance of centre from y-axis)
centre
1(c)![]()
Question 2
(a)
2(a)![]()
(b)
(i)
(ii)
2(b)(ii)![]()
(c)
(i)
2(c)(i)![]()
(ii)
2(c)(ii)![]()
(iii)
bisects
Question 3
(a)
area
3(a)![]()
(b)
(i)
(b)
3(b)(ii)![]()
(c)
(i)
at any point on the first line,
at any point on the second line,
at the point of intersection, both
and
The point of intersection is on that line.
(ii)
slope of the line,
3(c)(ii)![]()
(iii)
logically, no matter how large l becomes, short of reaching infinity it can never make the line
to prove, slope of
if we put that slope we get a contradiction:
which cannot be true.
3(c)(iii)![]()
Question 4
(a)
(b)
4(b)![]()
(c)
(i)
| draw the triangle abc(note:acb is a right angle, JC proof) | draw the triangle aoc |
| draw a line from o to ac, splitting it perpendicularly. | |
| right angled triangle of side r and | |
4(c)(i)![]()
(ii)
draw a line from o to c
the sector, ocb has angle and area
the triangle aoc has base and height
area
these two areas together make half the area of the semi circle
[
cancle across the equation.]
Question 5
(a)
because
5(a)![]()
(b)
[remember
and
]
now take and remember
and
(c)
triangle of side ,
and c.
but
5(c)![]()
Question 6
(a)
(i)
6 possible people in first seat, 5 in second etc
6(a)(i)![]()
(ii)
take mary and john as a unit and give arrangements of five times arrangements of two(the john and mary unit)
6(a(ii)![]()
(b)
are roots of
and
(c)
(i)
probability of first disk being red
probability of second disk being red, given that first disk was
probability of both being red
6(c(i)![]()
(ii)
6(c(ii)![]()
(iii)
if and
the root of 33 is not a whole number and r must be an integer (must have a whole number of red disks)
if and
the root of 93 is not a whole number and r must be an integer (must have a whole number of red disks)
if and
or
but r cannot be negative.
and
6(c(iii)![]()
Question 7
(a)
(i)
how many four letter selections from seven
7(a)(i)![]()
(ii)
3 vowels and 4 consonants, only on possibility for no vowels.
7(a)(ii)![]()
(b)
(i)
total possibilities after throwing two dice
number of possibilities with identical numbers - 6
number of possibilities that add up to five = 4
number of possibilities that do both - 0
7(b)(i)![]()
(ii)
list the possibilities-
7(b)(ii)![]()
(c)
(i)
numbers:
mean:
7(c)(i) a + 3d
(ii)
deviations:
squared:
standard deviation:
Section B
Question 8
(a)
differentiate:
put equal to zero to find max value
8(a)![]()
(b)
(i)
(ii)
test for convergence:
[
cancles out
.
cancles out
. The pattern in
etc is getting smaller so the smaller number
remains.]
series converges for
(c)
change of limits: when and when
8(c)![]()
Question 10
(a)
(i)
The set of natural numbers under subtraction is not closed. For example, , and
is not a natural number. Subtraction is also not associative.
(ii)
has no inverse in the set of real numbers.
(b)
(i)
First, let's draw the Cayley table:
| o | ||||
From this, we can clearly see that this set is closed under composition.
We can also see that o
o
for all
, this
is the identity.
As appears exactly once in every row and column, we have inverses.
Finally, we may assume associativity.
Thus, G forms a group under compisition.
(ii)
Note from the Cayley table that G is an Abelian/commutitive group - thus .
(c)
(i)
By Lagrange's theorem, if a group has prime order, then it has no proper subgroups.
Let be the order of
,
. Then the group {
,
,
,...,
} is a subgroup of G. But G has no proper subgroups, so this must be the whole group. Thus the group is generated by
and so is cyclic.
(ii)
Let be the order of
,
. Then the group {
,
,
,...,
} is a subgroup of G, with
elements.
Therefore, by Lagrange, is a factor of the order of
. Thus the order of any element is a factor of the order of the group.




