MATH HL

EXERCISES 2.8-2.10 SOLUTIONS

EXPONENTS AND LOGARITHMS
Compiled by: Christos Nikolaidis
A. Practice Questions

ln 5 − 1 e5 − 1 log 2 5 − 1 25 − 1
1. (a) x = (b) x = (c) x = (d) x = .
3 3 3 3
 x3 y 
2. log 2  4  = 3a + b − 12c .
 z 
 
3. (a) x = 1, x = 4 (b) x = 3 ( x = −2 rejected)
1 1
4. (a) x = 16 , x = (b) x = 5 3 (= 125) , x = 5 −3 ( = )
4 125
ln 12
5. x=
ln(3 / 4)
6. (a) x = −1 (b) x = 0 , x = 3
 2e 3 
7. (a) x = 0 , x = ln 2 (b) x = ln 6 
 e −1
8. (a) x = e , x = 1 / e , (b) x = 10 , x = 1 / 10 (c) x = 7 , x = 1 / 7 (d) x = 4 , x = 1 / 4
9. x = 4, y =8
3 24
10. x= , y=
22 11
1 3
11. x = 1 , y = 3 or x = , y =
4 2
12. x = 64 , y = 16
ln 2[(1 − (ln 2)10 ] ln 2
13. (a) 55 ln 2 (b) (c)
1 − ln 2 1 − ln 2
−1
14. (a) f ( x) = ln( x + 2)
(b) For f , x-intercept: x = ln 2 , y-intercept: y = −1 , Horizontal asymptote: y = −2
−1
For f , x-intercept: x = −1 , y-intercept: y = ln 2 , Vertical asymptote: x = −2
(d) For f , Domain: x ∈ R , Range: y > −2
For f −1 , Domain: x > −2 , Range: y ∈ R
15. (a) f −1 ( x) = ln x − 2
(b) For f , there is no x-intercept, y-intercept: y = e 2 , Horizontal asymptote: y = 0
For f −1 , x-intercept: x = e 2 , there is no y-intercept, Vertical asymptote: x = 0
(c) For f , Domain: x ∈ R , Range: y > 0
For f −1 , Domain: x > 0 , Range: y ∈ R
16. (a) f −1 ( x) = ln( x − 2) + 3
(b) For f , y-intercept: (0, e −3 + 2) , Horizontal asymptote: y = 2
For f −1 , x-intercept: (e −3 + 2,0) , Vertical asymptote: x = 2
(c) For f , Domain: x ∈ R , Range: y > 2
For f −1 ,, domain: x > 2 , Range: y ∈ R
(d) x = ln 4 + 3

1
B. Past Paper questions (SHORT)
1
17. 16 2 = 3 100 − x 2 (M2)
4 = 100 − x
3 2
(A1)
64 = 100 – x2 (M1)
x2 = 36, so x = ±6 (A1)(A1) (C6)
Note: Award (C1) if only x = 6 is given without working.
[6]
18.

[6]

19. Given log2 (5x2 – x – 2) = 2 + 2 log2 x

⇒ log2 (5x2 – x – 2) = log2 4 + 2 log2 x
⇒ log2 (5x2 – x – 2) = log2 4x2 (A1)
⇒ x2 – x – 2 = 0⇒ x = 2 (A1) (A1)
(negative solution not possible)
[3]
Extra question
It is the same equation (after a change of base)

20.

[6]
Extra question
If you let y = e x , it is the same equation. Then e x = 15 ⇒ x = ln 15

2
21.

[6]
22.

[6]
50 50
23. ∑ ln(2 ) = ∑ r (ln 2)
r =1
r

r =1
(M1)
50
= (ln2) ∑r
r =1
(M1) (A1)

  50  
= (ln2)   51 (M1) (A1)
 2  
= 1275 ln2 (A1) (C6)
[6]
Extra question
ln x[(1 − (ln x) 50 ]
(a) 1275 ln 2 (b)
1 − ln x
24. METHOD 1
x2 x2 x2
lnx2 + ln + ln 2 + ln 3 + …
y y y
= lnx2 + (lnx2 – lny) +(lnx2 – 2lny) + (lnx2 – 3lny) +… (M1)
n 35
S35 = (2u1 +(n – 1)d) = (2 lnx2 – 34 lny) = 35 lnx2 – 595 lny2 (M1)(A1)
2 2
70 595
= lnx – lny
x 70
= ln 595 (Accept m = 70, n = 595) (A1)(A1) (N2)
y
METHOD 2
x2 x2 x2 x 2 x 2 ...x 2
lnx2 + ln + ln 2 + ln 3 + ... = ln (M1)(A1)
y y y 1 y... y 34
35
In the denominator, the sum of the powers of y is (0 +34) = 595 (A1)
2
The required expression is
x 70
ln 595 (Accept m = 70, n = 595) (A1)(A1) (N2)
y
[5]

3
25. Taking logs, xln3 + (2x + 1)ln4 = (x + 2)ln6 (M1)(A1)
x(ln3 + 21n4 – ln6) = 21n6 – ln4 (A1)
2 ln 6 – ln 4
x= (A1)
(ln 3 + 2 ln 4 – ln 6 )
ln 9  ln81 
=  Accept or equivalent  (M1)(A1)
ln 8  ln64 
(or a = 9, b = 8) (C3)(C3)
[6]
26.

[6]
3
27. 2(5x+1) = 1 + x
5
3
10(5x) = 1 + x (M1)
5
10(52x) = 5x + 3 (M1)
10(52x) – 5x – 3 = 0(5(5x) – 3)(2(5x) + 1) = 0 (M1)
3
5x = (A1)
5
3
x = log5 (M1)
5
x = –1 + log53 (A1) (C6)
[6]
Extra question
If you let y = 5 x , it is the same equation.

28.

4
 [6]
x ( x − 2)
29. (a) f ( x) = ln (M1)
x2 − 4
x
= ln (Accept a = 2) (A1) (C2)
x+2
 y 
(b) For switching variables  x = ln  (M1)
 y+2
y
ex = (M1)
y+2
ye x − y = y (e x − 1) = −2e x (A1)
2e  2e
x x
2 
f −1 ( x) = − = = −x  (A1) (C4)
e −1  1− e
x x
e −1
[6]
30. (a) z=9 ⇒ y = log 3 z = 2 , thus x = 2.3 (A1) (A1) (C2)
5  9z 
(b) log3 z − log3 = 2( x − 1) , thus log3   = 2( x − 1) (M1)(A1)(A1)
9  5
5 2( x−1)  5 x 
z= 3 = 9  (A1) (C4)
9  81 
[6]

31.

[6]

5
32.

[6]
LONG QUESTIONS

33. (a) (i) The graph of y = f(x) is as follows:

y

x
0

The minimum value of f(x) is 0 (A2)

(ii) From part (i), f(x) ≥ 0 for all x (M1)(R1)
⇒ ex – 1 – x ≥ 0 (A1)
x
⇒e ≥1+x (AG)
 1  1   1 
(b) Let P(n) be the proposition: (1 + 1) 1 + 1 + ...1 +  = n + 1 (M1)
 2  3   n
P(1) is true since (1 + 1) = 2 and n + 1 = 2 when n = 1 (M1)
Assume P(k) is true for some integer k ≥ 1.
 1  1   1 
That is, (1 + 1) 1 + 1 + ...1 +  = k + 1 (M1)
 2  3   k 
 1  1   1  1   1 
Then, (1 + 1) 1 + 1 + ...1 + 1 +  = (k + 1) 1 +  (M1)
 2  3   k  k + 1   k +1
= (k + 1) + 1
Thus, P(k) ⇒ P(k + 1), and so P(n) is true for all integers n ≥ 1 (R1)
(c) e(1+1/2+1/3+...+1/n) = e1e1/2e1/3...e1/n (M1)
 1  1   1 
≥ (1 + 1) 1 + 1 + ...1 +  (from (a) (ii))
 2  3   n
= n + 1 (from (b)) (M1)
>n (AG)
1 1 1
(d) 1 + + + ... + > 100 ⇒ e(1+1/2+1/3+...+1/n) > e100 (M1)
2 3 n
We require a value for n for which n > e100. (R1)
Any integer greater than e100 will do. (A1)
[18]