Scholarship Calculus (93202) 2016 — page 1 of 10

Assessment Schedule – 2016

Scholarship Calculus (93202)
Evidence Statement

Question One
(a) Method 1
y 3 − (x − 2)2
=
x x
d ⎛ y⎞ −2(x − 2)⋅ x 3 − (x − 2)2
⎜⎝ ⎟⎠ = − =0
dx x 2 3 − (x − 2)2 ⋅ x 2 x2
1 ⎛ y⎞
(x − 2)2 − 3 − (x − 2)x = 0; x = , ⎜ ⎟ = 3
2 ⎝ x ⎠ max
Method 2
2
⎛ y⎞ 3− (x − 2)2
⎜⎝ x ⎟⎠ = x2
=m

⎛ y⎞
(m + 1)x 2 + 4x + 1 = 0, Δ = 16 − 4(m + 1) ≥ 0, m ≤ 3, ⎜ ⎟ ≤ 3
⎝ x⎠
(b)(i)
x2
y ′ = 2x ln(1+ x) +
1+ x
(
= 2x ln(1+ x) + x − 1+ (1+ x)−1 )
⎛ 2x ⎞
y ′′ = 2 ln(1+ x) + ⎜ + 1+ (−1)(1+ x)−2
⎝ 1+ x ⎟⎠
( )
= 2 ln(1+ x) + 2 − 2(1+ x)−1 + 1+ (−1)(1+ x)−2
f (2)
(0) = 0 + 0 + 1− 1 = 0

(ii)
x2
y ′ = 2x ln(1+ x) +
1+ x
(
= 2x ln(1+ x) + x − 1+ (1+ x)−1 )
⎛ 2x ⎞
y ′′ = 2 ln(1+ x) + ⎜ + 1+ (−1)(1+ x)−2
⎝ 1+ x ⎟⎠
( )
= 2 ln(1+ x) + 2 − 2(1+ x)−1 + 1+ (−1)(1+ x)−2
y ′′′ = 2(1+ x) − 2(−1)(1+ x) + (−1)(−2)(1+ x)−3
−1 −2

...
y (2016)
= 2(−1)(−2)...(−2013)(1+ x)−2014 − 2(−1)(−2)...(−2014)(1+ x)−2015 + (−1)(−2)...(−2015)(1+ x)−2016
y(2016) (0) = −2 × 2013! − 2 × 2014! − 2015!
⎛ −2016!⎞
⎜⎝ = −2013!(2015 × 2016) = ⎟
2014 ⎠
 Scholarship Calculus (93202) 2016 — page 2 of 10

Question Two

(a)
π π π
2 2 2

∫ (sin ) ∫ ( cos x ) dx = ∫ (1− sin x )

2
5
x + cos x dx = 0 +
5 5 2
cos x dx
π π π
− − −
2 2 2
π π
2
⎡ 2sin 3 x sin 5 x ⎤ 2
( 2 4
)
= ∫ ⎡⎣ 1− 2sin x + sin x cos x ⎤⎦ dx = ⎢sin x − + ⎥ =
16
−
π ⎣ 3 5 ⎦ − π 15
2 2

(b)
π
2
sin 2nx
In = ∫ dx
0
sin x
π π

sin 2nx − sin(2nx − 2x)

2 2
2sin x cos(2nx − x)
I n − I n−1 = ∫ dx = ∫ dx
0
sin x 0
sin x
2 (2n − 1)π 2(−1)n−1
= sin =
2n − 1 2 2n − 1

(c)
Note the following facts:
1
tan θ + cot θ =
sin θ cosθ
logb
log a b = .
log a
log cosθ log cosθ log cosθ
∴log tanθ +cotθ cosθ = = =−
log(tan θ + cot θ ) − log(sin θ cosθ ) logsin θ + log cosθ
1 logsin θ 1
=− =k → = − −1
logsin θ log cosθ k
+1
log cosθ
logsin θ logsin θ 1 1 k +1
log tanθ sin θ = = = = =
log tan θ logsin θ − log cosθ 1− log cos θ k 2k + 1
1+
logsin θ k +1
 Scholarship Calculus (93202) 2016 — page 3 of 10

Question Three
(a) Let f (x) = x − a .
π π π
2 2 π 2 π

a = ∫ f (x)sin x dx = ∫ (x − a)sin x dx = [ −x cos x ] + ∫ cos x dx + [ a cos x ] 2 = 1− a

2
0 0
0 0 0

1 1
a= ∴ f (x) = x −
2 2

(b)
d(e2 x y) dy
(1) = 2e2 x y + e2 x = 2e2 x y + e2 x (x − 2y) = xe2 x
dx dx
1 1 1 1
(2) e2 x y = ∫ xe2 x dx = xe2 x − ∫ e2 x dx = xe2 x − e2 x + c
2 2 2 4
1 1 3
e2 = e2 − e2 + c → c = e2
2 4 4
⎛1 3 ⎞ 1
1
(
y = e−2 x ⎜ xe2 x − e2 x + e2 ⎟ = 3e2−2 x + 2x − 1
⎝2 4 4 ⎠ 4
)
 Scholarship Calculus (93202) 2016 — page 4 of 10

Question Four
sin 2 α 9 1
(a) Asymptotes y = ±3x, tan α = 3, = 9, sin 2 α = , cos 2 α =
1− sin α2
10 10
9 1
sin θ = sin(180 0 − 2α ) = sin(2α ) = 2 × × = 0.6
10 10
(b) Method 1
3x0 − y0 3x0 + y0 36
y = ±3x, ⋅ = = 3.6
10 10 10

Method 2
l1 : y = 3x,
1
lPA : y − y0 = − (x − x0 ) → A :(0.1x0 + 0.3y0 , 0.3x0 + 0.9y0 )
3
1
PA = 0.9x02 + 0.1y02 − 0.6x0 y0 = 3x0 − y0
10
l2 : y = −3x,
1
lPB : y − y0 = (x − x0 ) → B :(0.1x0 − 0.3y0 , − 0.3x0 ,+0.9y0 )
3
1
PB = 0.9x02 + 0.1y02 + 0.6x0 y0 = 3x0 + y0
10
3x − y 3x + y 36
PA ⋅ PB = 0 0 ⋅ 0 0 = = 3.6
10 10 10

(c) Let P(x0 , y0 ), mCD = k. Note: k > 3

lCD : y − y0 = k(x − x0 ), y = ±3x
⎛ kx − y 3(kx0 − y0 ) ⎞ ⎛ kx0 − y0 −3(kx0 − y0 ) ⎞
C :⎜ 0 0 , ⎟ , D : ⎜⎝ , ⎟
⎝ k−3 k−3 ⎠ k+3 k+3 ⎠
Note that sin ∠COD = 0.6
1 ⎛ kx − y ⎞ ⎛ kx − y ⎞
Area ΔCOD = × 0.6 × 10 ⎜ 0 0 ⎟ × 10 ⎜ 0 0 ⎟
2 ⎝ k−3 ⎠ ⎝ k+3 ⎠
3( kx0 − y0 )
2

= (1)
(k 2 − 9)
Since CP : PD = 1: λ ,
1 ⎛ kx0 − y0 kx0 − y0 ⎞ kx0 − y0 ⎛ λ 1 ⎞
x0 = ⎜λ + ⎟= ⎜ + ⎟,
λ +1⎝ k+3 k−3 ⎠ λ + 1 ⎝ k + 3 k − 3⎠
1 ⎛ −3(kx0 − y0 ) 3(kx0 − y0 ) ⎞ 3(kx0 − y0 ) ⎛ − λ 1 ⎞
y0 = ⎜⎝ λ + ⎟⎠ = ⎜⎝ + ⎟ (2)
λ +1 k+3 k−3 λ +1 k + 3 k − 3⎠
x02 y02
− =1→
( kx0 − y0 ) = ( λ + 1)
2 2

4 36 (k 2 − 9) λ
3( λ + 1)
2
⎛ 1⎞
area ΔCOD = = 3⎜ λ + 2 + ⎟ ,
λ ⎝ λ⎠
1
min area ΔCOD = 12, when λ = 1 (since λ + ≥ 2).
λ
 Scholarship Calculus (93202) 2016 — page 5 of 10

Question Five
(a)
⎛ 2kπ ⎞ ⎛ 2kπ ⎞
zi = cos ⎜ ⎟ + i sin ⎜ , k = 0, ± 1, ± 2, ± 3, ± 4, ± 5,
⎝ 11 ⎠ ⎝ 11 ⎟⎠
∵ z11 + 0 ⋅ z − 1 = 0
11
∴ ∑ zi = 0;
1

⎛ ⎛ 2π ⎞ ⎛ 2π ⎞ ⎞ ⎛ ⎛ 10π ⎞ ⎛ 10π ⎞ ⎞
1+ ⎜ cos ⎜ ± ⎟ + i sin ⎜ ± ⎟ ⎟ + ... + ⎜ cos ⎜ ± ⎟ + i sin ⎜ ± =0
⎝ ⎝ 11 ⎠ ⎝ 11 ⎠ ⎠ ⎝ ⎝ 11 ⎠ ⎝ 11 ⎟⎠ ⎟⎠
⎛ 2π ⎞ ⎛ 4π ⎞ ⎛ 6π ⎞ ⎛ 8π ⎞ ⎛ 10π ⎞ 1
cos ⎜ ⎟ + cos ⎜ ⎟ + cos ⎜ ⎟ + cos ⎜ ⎟ + cos ⎜ =−
⎝ 11 ⎠ ⎝ 11 ⎠ ⎝ 11 ⎠ ⎝ 11 ⎠ ⎝ 11 ⎟⎠ 2

(b) EITHER

Question Type
Group 1 (x1) Group 2 (x2) Group 3 (x3)
Marks 4 5 6
Time 2 3 4

x1 + x2 + x3 ≤ 100 constraint 1
2x1 + 3x2 + 4x3 ≤ 210 constraint 2
2x1 + 3x2 ≤ 150 constraint 3
x1 ≥ 0 constraint 4
x2 ≥ 0 constraint 5
x3 ≥ 0 constraint 6
Objective function: Grade = 4x1 + 5x2 + 6x3
Feasible Solutions are found at vertices. (0,0,0) is feasible but not helpful. Constraint (1) has vertices (100,0,0), (0,100,0) and
(0,0,100). However, constraints 3 and 2 define the max values for the question groups as x1 ≤ 75, x2 ≤ 50 and x3 ≤ 52.
Constraint 2 has vertices (105,0,0), (0,70,0), (0,0,52.5). This plane lies mostly between the plane defined by constraint 1 and
the origin. All intersections lie in a region where x1 > 75. By constraint 3, no feasible solutions in this region. Any feasible
solutions now lie between plane 2 and the origin.
Only one vertex of plane 2 offers a feasible solution, being (0,0,52.5). After truncation, the objective function yields
Grade = 4 × 0 + 5 × 0 + 6 × 52 = 312.
The vertices of constraint 3 are (75,0,0), (0,50,0) and (0,0,x3): a plane with one side fixed and the other two dependent on x3.

This plane lies between the planes defined by constraints 1 & 2 and the origin, with no intersections.
Objective function applied to the vertices (75,0,0) and (0,50,0) gives us, respectively,
Grade = 4 × 75 = 300 and Grade = 5 × 50 = 250. We have no improvement on 312.
The value of x3 in constraint 3 is “checked” by constraint 2. Consider the boundary equations from constraints 2 & 3:
2x1 + 3x2 + 4x3 ≤ 210 eq 2
2x1 + 3x2 = 150 eq 3
Eq 2 – eq 3 gives 4x3 = 60 or x3 = 15.
So, fixing x3 = 15 means the other two vertices of constraint 3 are (75,0,15) and (0,50,15).
 Scholarship Calculus (93202) 2016 — page 6 of 10

Applying these vertices to the objective function gives:

(0,0,15) Grade = 6 × 15 = 90
(75,0,15) Grade = 75 × 4 + 15 × 6 = 390
(0,50,15) Grade = 50 × 5 + 15 × 6 = 340
The student should therefore complete 75 group 1 questions and 15 group 3.
 Scholarship Calculus (93202) 2016 — page 7 of 10

Alternative solutions:

Iterative approach to Linear Programming Question – some students may know this method from extension classes or
conjoint university papers.
Table 1
Introducing slack variables x4, x5 and x6
Grades 4 5 6 0 0 0 Eqn
Variable x1 x2 x3 x4 x5 x6
X4 1 1 1 1 0 0 100 100
X5 2 3 4 0 1 0 210 52.5
X6 2 3 0 0 0 1 150 NA
Zi 0 0 0 0 0 0
Δi –4 –5 -6 0 0 0

Table 2, new basis x4, x3, x6

Grades 4 5 6 0 0 0 Eqn
Variable x1 x2 x3 x4 x5 x6
X4 1/2 1/4 0 1 –1/4 0 47.5 95
X3 1/2 3/4 1 0 1/4 0 52.5 105
X6 2 3 0 0 0 1 150 75
Zi 3 18/4 6 0 3/2 0
Δi –1 –1/2 0 0 3/2 0

Table 3, new basis x4, x3, x1

Grades 4 5 6 0 0 0 Eqn
Variable x1 x2 x3 x4 x5 x6
X4 0 –1/2 0 1 –1/4 0 10
X3 0 0 1 0 ¼ 0 15
X1 1 3/2 0 0 0 1/2 75
Zi 4 6 6 0 3/2 2
Δi 0 1 0 0 3/2 2

No negative Δi, end of iterations and the optimal basis is x4, x3, x1. x4 is slack with zero grade value, so the objective function
gives Grade = 75 × 4 + 15 × 6 = 390.
 Scholarship Calculus (93202) 2016 — page 8 of 10

OR

We redefine the tasks by splitting A, B, C and D into subtasks.

Task Duration Dependency tree

A1 (1/3 complete) 1
A2 (2/3 complete) 1 A1
A3 (complete) 1 A2
A4 (1 hour after completion of A) 1 A3
B1 (1/2 of B) 2 A1
B2 (1/2) of B) 2 B1, A4
B3 (1 hour after completion of B) 1 B2
C1 (first 1/2 of C) 2.5 B1
C2 (3/5 of C complete) 0.5 B3
C3 (final 2/5 of C) 2 C2
D1 (first 1/2 of D) 1 A2, B2
D2 (second 1/2 of D) 1 D1
D3 (Completion) 0 D1,C2

Associated Network : Critical Path is A1, B1, B2, B3, C2, C3. Duration is 8.5 hours.
 Scholarship Calculus (93202) 2016 — page 9 of 10

Additional Solutions Scholarship Calculus 93202

Question One
y
(a) (x,y) is on circle. Maximum of =k y = kx
x
Want maximum gradient k
Occurs when k = tan(angle) = tan 60 = 3

Question Three

(a) Clearer solution.

Note that a definite integral is a constant, thus f (x) = x – a, f '(x) =1 and f (0) = –a.

π π π
a = ∫ 2 f (x)sin x dx = [− f (x)cos x]02 − ∫ 2 f (x)(− cos x)dx
0 0
π
a = f (0) + ∫ cos x dx
2
0

a = −a + 1
1
a=
2
1
Required function (x) = x −
2

Question Five
(b): Alternative (shorter) method for Linear Programming option.

Further constraints: 2x1 + 3x2 + 4x3 ≤ 210 2x1 + 3x2 ≤ 150 ⇒ x3 ≥ 15

As the only constraint (apart from questions answered) is time related, to maximise the grade we should consider points per
minute when determining what is the optimal solution.
G = 4x1 + 5x2 + 6x3

Question Time Points Points per minute

x1 2 4 2
x2 3 5 1.67
x3 4 6 1.5
 
So complete as many x1 as possible (150 minutes 75 of these)
The rest of the time should be spent on x3 (60 minutes left 15 of these).

Maximum grade = 390 with the combination (x1,x2 x3) = (75,0,15)

 Scholarship Calculus (93202) 2016 — page 10 of 10

(b) Networks option – Gantt chart solution