Topic 5. Harder Unit Topics.

Level 1.
Problem HAR1_01.
a+b
If 0 < a < b show that a < <b.
2

a +b a+b
Solution: If 0 < a < b , then 2 a < a + b , a < , and a + b < 2b , < b . Hence
2 2
a+b
a< < b with equality iff a = b .
2

Problem HAR1_02.
If 0 < a < b show that a < ab < b .

Solution: If 0 < a < b , then a 2 < ab , a < ab , and ab < b2 , ab < b . Hence

a < ab < b with equality iff a = b .

Problem HAR1_03.
a+b
If a > 0 , b > 0 show that > ab .
2

Solution: It is clear that ( a + b )2 = ( a − b )2 + 4ab ⇒ ( a + b ) 2 > 4 ab (equality iff

a = b ), since ( a − b )2 ≥ 0 . Then, if a > 0 , b > 0 , we get
a+b
> ab (equality iff a = b ).
2

Problem HAR1_04.
1
If x >0 show that x+ ≥2.
x

a +b 1
Solution: Using the inequality ≥ ( ab ) (equality iff a = b ) for a = x , b = we
2 x
get
1 1 1
x+ ≥ 2 ( x ⋅ ) = 2 (equality iff x = , i.e., x = 1 ).
x x x

Problem HAR1_05.
If a > 0 , b > 0 show that 4 ab ≤ ( a + b ) 2 .

Solution: (a + b )
2
= ( a − b ) 2 + 4 ab ≥ 4 ab (equality iff a = b ).

Problem HAR1_06.
If a > 0 , b > 0 and c > 0 show that ( a + b )( b + c )( c + a ) ≥ 8 abc .
Solution: It is easily seen that
( a + b ) 2 ≥ 4 ab ,
( b + c ) 2 ≥ 4 bc ,
( a + c ) 2 ≥ 4 ac ,

since ( a + b )2 = ( a − b )2 + 4ab ⇒ ( a + b )2 > 4 ab (equality iff a = b ). By

multiplication, we get
( a + b )2 ( b + c )2 ( c + a )2 ≥ 43 a2 b2 c 2 .
Hence ( a + b )( b + c )( c + a ) ≥ 8 abc with equality iff a = b = c .

Problem HAR1_07.
If a > 0 , b > 0 , c > 0 and a +b +c =1 show that (1 − a )(1 − b )(1 − c ) ≥ 8 abc .

Solution: a + b + c = 1 ⇒ 1 − a = b + c , 1 − b = a + c and 1 − c = a + b . So we need to show

that ( a + b )( b + c )( c + a ) ≥ 8 abc . Obviously, ( x + y ) 2 = ( x − y ) 2 + 4 xy ⇒ x + y ≥ 2 xy .
Hence
a + b ≥ 2 ab
b + c ≥ 2 bc ,
a + c ≥ 2 ac ,
By multiplication
( a + b )( b + c )( c + a ) ≥ 2 3 abc .

Problem HAR1_08.
1 1
If a > 0 , b > 0 and a +b =1, show that + ≥ 4 . Hint: Show that a + b ≥ 2 ( ab ) .
a b

( )
2
Solution: a− b ≥ 0 ⇒ a + b − 2 ab ≥ 0 ⇒ a + b ≥ 2 ab (equality iff a = b ).

( a + b) ( a + b)
2 2

From a + b ≥ 2 ab ⇒ ab ≤ and 2ab ≤ .

4 2
1 1 b+a a+b 4
+ =
Hence ≥ = =4.
a b ab ( a + b) a + b
2

4
Problem HAR1_09.
1 1
If a > 0 , b > 0 and a +b =1, show that + ≥ 8 . Hint: Show that a + b ≥ 2 ( ab ) .
2 2
a b

(
( a + b) − 2
a + b)
2
2

1 b2 + a2 ( a + b) − 2 ab
2
1  1
Solution: + = = ≥ = 161 −  = 8 ,
a 2 b2 ( ab)2 ( ab)2  ( a + b)2 
2
 2
 
 4 
(equality iff a = b = 1 / 2 ).

Problem HAR1_10.
 Show that ab + bc + ca ≤ a 2 + b2 + c 2 .

2
x + y2
Solution: Notice that (x − y )2 ≥ 0 ⇒ x 2 + y 2 − 2 xy ≥ 0 ⇒ xy ≤ . Hence
2
a
2
+b2 b2 + c 2 c2 + a2
ab ≤ , bc ≤ and ca ≤ . Summing these inequalities, we get
2 2 2
ab + bc + ca ≤ a 2 + b2 + c 2 (equality iff a = b = c ).

Problem HAR1_11.
If a > 0 and b > 0 , show that a
3
+ b 3 ≥ a 2 b + ab 2 .

Solution: Notice that

( a 3 + b 3 ) − ( a 2 b + ab 2 ) = a 2 ( a − b ) − b 2 ( a − b ) = ( a − b )( a 2 − b 2 ) = ( a − b ) 2 ( a + b ) ≥ 0 .
Hence a
3
+ b 3 ≥ a 2 b + ab 2 (equality iff a = b = c ).

Problem HAR1_12.
Show that ( a + b )2 ≤ 2( a 2 + b2 ) .

Solution: Consider a 2 + b2 ≥ 2 ab . By adding a 2 + b2 into both sides of the

inequality, we get
( a + b )2 ≤ 2( a 2 + b2 ) (equality iff a = b ).

Problem HAR1_13.
Show that ( a3 + b3 )2 ≤ ( a 2 + b2 )( a 4 + b4 ) .

Solution: It is clear that

( a 2 + b2 )( a 4 + b4 ) − ( a3 + b3 )2 = a 2b4 − 2 a3b3 + b2 a 4 = a 2b2 ( a 2 − 2 ab + b2 ) =
= a 2b2 ( a − b)2 ≥ 0 .
Hence
( a3 + b3 )2 ≤ ( a 2 + b2 )( a 4 + b4 ) (equality iff a = b ).

Problem HAR1_14.
Show that ( a + b + c ) 2 ≤ 3( a 2 + b 2 + c 2 ) .

Solution: Consider
3( a2 + b2 + c 2 ) − ( a + b + c )2 = 2( a 2 + b2 + c 2 − ab − bc − ac )
= ( a − b)2 + ( a − c )2 + ( b − c )2 ≥ 0.
Hence 3( a 2 + b2 + c 2 ) ≥ ( a + b + c )2 ( equality iff a = b = c ).

Problem HAR1_15.
a +b +c +d
If a > 0 , b > 0 , ñ >0 and â >0, show that ≥ 4 ( abcd ) . Hint: if a > 0 and
4
b > 0 , show that a + b ≥ 2 ab .
Solution: It is clear that ( a + b )2 ≥ 4ab (equality iff a = b ), since
( a + b )2 = ( a − b)2 + 4 ab . If a > 0 and b > 0 , we have
a + b ≥ 2 ab (equality iff a = b ),
a+b
≥ ab (equality iff a = b ).
2
Consider
a+b c+d
a+b+c+d +
= 2 2 .
4 2
a+b c+d
Using the inequality proved above with respect to and , we come to
2 2
a+b+c+d ab + cd
≥ .
4 2
Employing the same inequality once again with respect to the right-hand side of the
last inequality, we obtain
a+b+c+d
≥ ab cd = 4 abcd .
4
a +b +c +d
Hence ≥ 4 ( abcd ) (equality iff a = b = c = d ).
4

Problem HAR1_16.
Show that e x > 1 + x ( x > 0 ).

Solution: Let f ( x ) = e x − 1 − x . It is clear that f ′( x ) = e x − 1 > 0 for x > 0 . Thus,

f ( x ) is a not decreasing function for x > 0 . Function f ( x ) has an absolute minimum
of 0 when x = 0 . Hence, for x > 0 f ( x ) > 0 , and e x > 1 + x for x > 0 .

Problem HAR1_17.
1 1
If 0 < t < 1 show that < < 1 . By integrating between 0 and u, deduce that for
2 1+ t
u
0 < u < 1, < ln(1 + u) < u .
2

Solution: It is easily seen that for 0 < t < 1 we have

1 1 1− t 1 1
− = > 0, < ,
1 + t 2 2(1 + t ) 2 1+ t
1 t 1
1− = > 0, 1 > .
1 + t (1 + t ) 1+ t
Hence,
1 1
< < 1 for 0 < t < 1 .
2 1+ t
By integrating this inequality between 0 and u, we deduce that for 0 < u < 1
1u u
1 u

20
∫ dt < ∫ 1+ t dt < ∫ dt ,
0 0
u
< ln(1 + u) < u .
2

Problem HAR1_18.
1 1 1
Show that x − x 2 < ln(1 + x ) < x − x 2 + x 3 ( x > 0 ).
2 2 3

Solution: Let us prove that for t > 0

1
1− t < < 1− t + t2 .
1+ t
First, it is easily seen that (1 − t )(1 + t ) = 1 − t 2 < 1 for t > 0 , and hence
1
1− t < for t > 0 .
1+ t
Further, it is clear that t 3 = (1 − t + t 2 )(1 + t ) − 1 > 0 for t > 0 . Thus, we have
1
< 1 − t + t 2 for t > 0 .
1+ t
Hence, we arrive to the desired result
1
1− t < < 1 − t + t 2 for t > 0 .
1+ t
By integrating the last inequality between 0 and x, we derive
x x x
dt
∫ + < ∫ 1 + t ∫ (1 − t + t )dt ,
< 2
(1 t ) dt
0 0 0
1 1 1
x − x 2 < ln(1 + x ) < x − x 2 + x 3
2 2 3
for x > 0 .

Problem HAR1_19.
1 1
If 0 < t < 1 , show that < < 1 . By integrating between 0 and u, deduce that
2
2 1+t
u
< tan −1 u < u for 0 < u < 1 .
2

Solution: It is easily seen that for 0 < t < 1

1 1 1− t2 1 1 1 t2 1
− = >0⇒ < , 1− = >0⇒ < 1.
1+ t 2 2 2(1 + t )2 2 1+ t 2
1+ t 2
1+ t 2
1+ t2
1 1
Hence < < 1 for 0 < t < 1 . By integrating between 0 and u , we deduce
2 1+ t2
u u u
1 dt 1
∫2 dt < ∫1+t 2 < ∫ dt ⇒
2
u < ln(1 + u) < u
0 0 0
for 0 < u < 1 .

Problem HAR1_20.
1 b 1
If b ≥a >0 , show that ( b − a ) ≤ ln ≤ (b − a ) .
b a a
Solution: If a ≤t ≤b , then
1 1 1
≤ ≤ . By integrating
b t a
b b b
1 dt 1 1 b 1
∫b dt ≤ ∫ t
≤∫
a
dt ,
b
( b − a ) ≤ ln
a
≤
a
(b − a ) .
a a a

Problem HAR1_21.
If a > 1 and x > −1 , show that (1 + x ) a ≥ 1 + ax .

Solution: Let f ( x ) = (1 + x ) a − (1 + ax ) . f ′( x ) = a (1 + x ) a −1 − a ⇒ f ′( x ) = 0 , f ′( x ) < 0

for − 1 < x < 0 and f ′( x ) > 0 for x > 0 . Hence f ( x ) has an absolute minimum of 0
a
when x = 0 ⇒ f ( x) ≥ 0 for x > −1 ⇒ (1 + x ) ≥ 1 + ax for x > −1 .

Problem HAR1_22.
n ( n + 1)
Show that for n ≥ 1 , 1 + 2 + ... + n = .
2

Solution: Let u n = 1 + 2 + ... + n ⇒ u n +1 = u n + ( n + 1), u 1 = 1, n = 1, 2 ,... Hence it suffices

n ( n + 1) n ( n + 1)
to show that u n = . Define the statement S ( n ) : u n = , n = 1, 2 ,...
2 2
1(1 + 1)
Consider S (1) : u 1 = 1 = ⇒ S (1) is true. Let k be a positive integer. If S ( k ) is
2
k ( k + 1)
true, then u k = .
2
k ( k + 1)
Consider S ( k + 1) : u k +1 = u k + ( k + 1) = + ( k + 1)
2
if S ( k ) is true
( k + 1)( k + 2 )
= ⇒ S ( k + 1) is true.
2
Hence for all positive integers k, S (k ) true implies S ( k + 1) true. But S (1) is true,
n ( n + 1)
hence by induction S (n ) is frue for all n ≥ 1 : 1 + 2 + ... + n = u n = .
2

Problem HAR1_23.
Show that for n ≥ 1 1 + 3 + 5 + ... + ( 2 n − 1) = n 2 .

Solution: Let u n = 1 + 3 + 5 + ... + ( 2 n − 1) ⇒ u n +1 = u n + ( 2 n + 1), u 1 = 1, n = 1, 2 ,... Hence if

2 2
suffices to show that un = n . Define the statement S (n ) : u n = n , n = 1, 2 ,...
2
Consider S (1) : u 1 = 1 = 1 ⇒ S (1) is true. Let k be a positive integer. If S (k ) is true,
2
then uk = k .
2
Consider S ( k + 1) : u k +1 = u k + ( 2 k + 1) = k + 2 k +1
if S ( k ) is true
= ( k + 1) 2 ⇒ S ( k + 1) is true.
 Hence for all k ≥ 1 , S (k ) true implies S ( k + 1) true. But S (1) is true, hence by
2
induction S (n ) is true for all n ≥ 1 : 1 + 3 + 5 + ... + ( 2 n − 1) = n .

Problem HAR1_24.
n ( n + 1)( n + 2 )
Show that for n ≥ 1 1 ⋅ 2 + 2 ⋅ 3 + 3 ⋅ 4 + ... + n ( n + 1) = .
3

Solution: Let
u n = 1 ⋅ 2 + 2 ⋅ 3 + 3 ⋅ 4 + ... + n ( n + 1) ⇒ u n +1 = u n + ( n + 1)( n + 2 ), u 1 = 2 , n = 1, 2 ,...
n ( n + 1)( n + 2 )
Hence it suffices to show that u n = . Define the statement
3
(n 1 n 2)
(n ) un , 1 2 ,...

1 ⋅ (1 + 1)(1 + 2 )
Consider S (1) : u1 = 2 = ⇒ S (1) is true. Let k be a positive integer. If
3
k ( k + 1)( k + 2 )
S (k ) is true, then uk = .
3
Consider S ( k + 1) : u k + ( k + 1)( k + 2 )
k ( k + 1)( k + 2 )
= + ( k + 1)( k + 2 ) , if S ( k ) is true
3
( k + 1)( k + 2 )( k + 3)
⇒ S ( k + 1) is true.
3
Hence for all k ≥ 1 , S (k ) true implies S ( k + 1) true. But S (1) is true , hence by
n ( n + 1)( n + 2 )
induction S (n ) is true for all n ≥ 1 : 1 ⋅ 2 + 2 ⋅ 3 + 3 ⋅ 4 + ... + n ( n + 1) = .
3

Problem HAR1_25.
1 1 1 n
Show that n ≥1 + + ... + = .
1⋅ 2 2 ⋅3 n ( n + 1) ( n + 1)

1 1 1 1 1
Solution: Let u n= + + ... + ⇒ u n +1 = u n + , u1 = , n = 1, 2 ,...
1⋅ 2 2 ⋅3 n ( n + 1) ( n + 1)( n + 2 ) 2
n
Hence it suffices to show that un = . Define the statement
n +1
n
S (n ) : un = , n = 1, 2 ,...
n +1
1 1
Consider S (1) : u1 = = ⇒ S (1) is true. Let k be a positive integer. If S ( k ) is
2 1 +1
k
true, then uk = .
k +1
1
Consider S ( k + 1) : uk +
( k + 1)( k + 2 )
k 1
= + , if S (k ) is true
k +1 ( k + 1)( k + 2 )
2
( k + 1) k +1
= = ⇒ S ( k + 1) is true.
( k + 1)( k + 2 ) k +2
Hence for all k ≥ 1 , S (k ) true implies S ( k + 1) true. But S (1) is true, hence by
1 1 1 n
induction S (n ) is true for all n ≥1: + + ... + = .
1⋅ 2 2 ⋅3 n ( n + 1) ( n + 1)

Problem HAR1_26.
d
Using the product rule for differentiation show that for n ≥1 x
n
= n ⋅ x n −1 .
dx

d
Solution: Define the statement S ( n ) : x
n
= n ⋅ x n −1 , n = 1, 2 ,... .
dx
d
Consider S (1): x = 1 ⋅ x 0 = 1 ⇒ S (1) is true.
dx
d
Let k be a positive integer. If S ( k ) is true, then x
k
= k ⋅ x k −1 .
dx
Consider S ( k +1) . As S ( k ) is true, we get by using the product rule for
differentiation
d k +1 d k d d
x = k
(x ⋅ x ) = x ⋅x + x⋅ x
k
= x k + x ⋅ k ⋅ x k −1 = x k ⋅ ( k + 1) .
dx dx dx dx
Hence for all positive integers k , S ( k ) true implies S ( k +1) true. But S(1) is true,
d n
therefore by induction, S ( n ) is true for all positive integers n ≥ 1: x = n ⋅ x n −1 .
dx
Problem HAR1_27.
x n +1
Using integration by parts, show that for n ≥ 1 ∫ x n dx = +c.
n +1

x n +1
∫ x dx = +c,
n
Solution: Define the statement S ( n ) : n = 1, 2 ,...
n +1
x2
Consider S(1) : ∫ xdx = + c ⇒ S (1) is true.
2
x k +1
Let k be a positive integer. If S ( k ) is true, then: ∫ x k dx = +c.
k +1
dx k +1
Consider S ( k +1) . As S ( k ) is true, we get x k dx = . Integration by parts leads
k +1
to
dx k +1 x k + 2 1 x k +2 − I
I = ∫ x k +1dx = ∫ x ⋅ x k dx = ∫ x ⋅
= − ∫ x k +1
dx = .
k +1 k +1 k +1 k +1
 1  x k +2 xk +2
Hence I ⋅ 1 + = ⇒ I= .
 k + 1 k + 1 k+2
xk +2
Finally, we get ∫ x k +1dx = +c.
k+2
Hence for all positive integers k , S ( k ) true implies S ( k +1) true. But S(1) is true,
therefore by induction, S ( n ) is true for all integers n ≥ 1.
x n +1
∫ x dx = +c.
n
n +1
Problem HAR1_28.
n
d ( n − 1)!
Show that for n ≥1 ln( 1 − x ) = − .
n n
dx (1 − x )

n
d ( n − 1)!
Solution: Define the statement S ( n ) : ln( 1 − x ) = − , n = 1, 2 ,... .
n n
dx (1 − x )
d 1
Consider S (1): ln(1 − x ) = − ⇒ S (1) is true.
dx 1− x
k
d ( k − 1)!
Let k be a positive integer. If S ( k ) is true, then ln( 1 − x ) = − .
k k
dx (1 − x )
Consider S ( k +1) . If S ( k ) is true, we get by successive differentiation
d  d  d  ( k − 1)!  d  
k +1 k
d 1 
ln( 1 − x ) = ln( 1 − x )  = − = −( k − 1)!
k +1 dx  dx k  dx  k  dx  (1 − x ) k 
dx    (1 − x )   
1 k!
= −( k − 1)! ⋅ k =− .
(1 − x ) k +1 (1 − x ) k +1
Hence for all positive integers k , S ( k ) true implies S ( k +1) true. But S(1) is true,
dn ( n − 1)!
therefore by induction, S ( n ) is true for all integers n ≥ 1: ln(1 − x ) = − .
dx n
(1 − x )n

Problem HAR1_29.
Show that for n ≥ 3 , 2 n > 2n +1 .

Solution: Define the statement S (n ) : 2 n > 2 n + 1, n = 3, 4 ,...

Consider S ( 3) : 2 3 = 8 > 2 ⋅ 3 + 1 = 7 ⇒ S ( 3) is true. Let k be a positive integer, k ≥3.
If S (k ) is true, then 2 k > 2k +1 .
Consider S ( k + 1) : 2 k +1 = 2 ⋅ 2 k > 2 ( 2 k + 1)
if S (k ) is true
= 4k + 2
But 4 k + 2 − 2 ( k + 1) − 1 = 2 k > 0 ⇒ 4 k + 2 > 2 ( k + 1) + 1 ⇒ 2 k +1 > 2 ( k + 1) + 1 ⇒ S ( k + 1) is
true.
Hence for all positive k ≥ 3, S ( k ) true implies S ( k +1) true. But S ( 3) is true, hence by
n
induction, S ( n ) is true for all integers n ≥3: 2 ≥ 2n +1 .

Problem HAR1_30.
n
Show that for n ≥ 4 , n !≥ 2 .

n
Solution: Define the statement S (n ) : n ! ≥ 2 , n = 4 ,5 ,...

Consider S (4) : 4 ! = 24 > 2 4 = 16 ⇒ S ( 4 ) is true. Let k be a positive integer, k ≥4.

k
If S (k ) is true, then k !≥ 2 .
Consider S ( k + 1) : ( k + 1) ! = ( k + 1) k ! ≥ ( k + 1) 2 k
 if S (k ) is true
≥ 2 ⋅ 2 k = 2 k +1 ⇒ S ( k + 1) is true.
Hence for all k ≥ 4, S (k ) true implies S ( k +1) true. But S (4) is true, hence by
n
induction, S ( n ) is true for all n ≥4: n !≥ 2 .

Problem HAR1_31.
1 1 1 1
Show that for n≥2, + + ... + <1− .
2 2 2 n
2 3 n

1 1 1 1 1
Solution: Let u n= + + ... + ⇒ u n +1 = u n + , u2 = , n = 2 ,3,...
2 2 2 2
2 3 n ( n + 1) 2 2
1
Hence it suffices to show that un <1− . Define the statement
n
1
S (n ) : un <1− , n = 2 ,3,...
n
1 1
Consider S (2) : u2 = <1− ⇒ S ( 2 ) is true. Let k be a positive integer, k ≥ 2 .
4 2
1
If S (k ) is true, then u k <1 − .
k
1
Consider S ( k + 1) : u k +1 = u k +
( k + 1) 2
1 1
<1− + , if S (k ) is true
k ( k + 1) 2
2 2
k + k +1 k +k
=1− <1−
2 2
k ( k + 1) k ( k + 1)
1
=1− ⇒ S ( k + 1) is true.
k +1
Hence for all k ≥ 2, S (k ) true implies S ( k +1) true. But S (2) is true, hence S ( n ) is
1 1 1 1
true for all n≥2: + + ... + <1− .
2 2 2 n
2 3 n

Problem HAR1_32.
If u n = 5 n + 12 n − 1 , show that u n +1 = 5u n − 48 n + 16 and hence show that
u n is divisible by 16 for n ≥ 1 .

Solution: It is easily seen that

un +1 = 5n +1 + 12( n + 1) − 1 = 5 ⋅ (5n +1 + 12 n − 1) − 60n + 5 + 12 n + 11
= 5un − 48n + 16.
Define the statement S ( n ) : un is divisible by 16, n = 1, 2 ,...
Consider S(1) : u 1 = 16 ⇒ S (1) is true, since u1 is divisible by 16.
Let k be a positive integer. If S ( k ) is true, then uk = 16 ⋅ M for some integer M .
Consider S ( k +1) . As S ( k ) is true , we get
uk +1 = 5uk − 48 k + 16 = 5 ⋅ 16 M − 3 ⋅ 16k + 16 = 16(5 M − 3k + 1) .
Since 5 M − 3k + 1 is integer, we see that uk +1 is divisible by 16.
Hence for all positive integers k , S ( k ) true implies S ( k +1) is true. But S(1) is true.
Therefore by induction, S ( n ) is true for all positive integers n : un is divisible by 16
for n ≥ 1.

Problem HAR1_33.
If un = 9n +1 − 8n − 9 , show that un +1 = 9un + 64n + 64 , and hence show that un is
divisible by 64 for n ≥ 1.

Solution: It is easily seen that

un+1 = 9n + 2 − 8( n + 1) − 9 = 9 ⋅ 9 n +1 − 8 n − 17 =
= 9(9 n +1 − 8 n − 9) + 72 n + 81 − 8n − 17 = 9un + 64 n + 64.
Define the statement S ( n ) : un is divisible by 64, n = 1, 2 ,...
Consider S(1) : u 1 = 64 ⇒ S (1) is true, since u1 is divisible by 64.
Let k be a positive integer. If S ( k ) is true, then uk = 64 ⋅ M for some integer M .
Consider S ( k +1) . As S ( k ) is true , we get
uk +1 = 9uk + 64k + 64 = 9 ⋅ 64 M + 64 k + 64 = 64(9 M + k + 64) .
Since 9 M + k + 64 is integer, we see that uk +1 is divisible by 64.
Hence for all positive integers k , S ( k ) true implies S ( k +1) is true. But S(1) is true.
Therefore by induction, S ( n ) is true for all positive integers n : un is divisible by 64
for n ≥ 1.

Problem HAR1_34.
If un = 52 n + 3n − 1 , show that un is divisible by 9 for n ≥ 1.

Solution: It is easily seen that

un+1 = 52 n+ 2 + 3( n + 1) − 1 = 52 ⋅ 52 n + 3n + 2 =
= 25(52n + 3n − 1) − 75n + 25 + 3n + 2 = 25un − 72n + 27.
Define the statement S ( n ) : un is divisible by 9, n = 1, 2 ,...
Consider S(1) : u 1 = 5 2 + 3 − 1 = 27 ⇒ S (1) is true, since u1 is divisible by 9.
Let k be a positive integer. If S ( k ) is true, then uk = 9 ⋅ M for some integer M .
Consider S ( k +1) . As S ( k ) is true , we get
uk +1 = 25uk − 72 k + 27 = 25 ⋅ 9 M − 72k + 27 = 9( 25 M − 8k + 3) .
Since 25 M − 8 k + 3 is integer, we see that uk +1 is divisible by 9.
Hence for all positive integers k , S ( k ) true implies S ( k +1) is true. But S(1) is true.
Therefore by induction, S ( n ) is true for all positive integers n : un is divisible by 9
for n ≥ 1.

Problem HAR1_35.
If un = 2 n +2 + 32 n +1 , show that un+1 = 2un + 7 ⋅ 32 n +1 , and hence show that un is
divisible by 7 for n ≥ 1.

Solution: It is easily seen that

un+1 = 2n +3 + 32 n +3 = 2( 2 n +2 + 32 n +1 ) − 2 ⋅ 32 n +1 + 9 ⋅ 32 n +1 =
= 2un + 7 ⋅ 32 n +1.
Define the statement S ( n ) : un is divisible by 7, n = 1, 2 ,...
Consider S(1) : u 1 = 8 + 27 = 35 = 7 ⋅ 5 ⇒ S (1) is true, since u1 is divisible by 7.
Let k be a positive integer. If S ( k ) is true, then uk = 7 ⋅ M for some integer M .
Consider S ( k +1) . As S ( k ) is true , we get
uk +1 = 2uk + 7 ⋅ 32 k +1 = 2 ⋅ 7 M + 7 ⋅ 32 k +1 = 7( 2 M + 32 k +1 ) .
Since 2 M + 32 k +1 is integer, we see that uk +1 is divisible by 7.
Hence for all positive integers k , S ( k ) true implies S ( k +1) is true. But S(1) is true.
Therefore by induction, S ( n ) is true for all positive integers n : un is divisible by 7
for n ≥ 1.

Problem HAR1_36.
If u1 = 5 , u2 = 11 and un = 4un−1 − 3un−2 for n ≥ 3, show that un = 2 + 3n for n ≥ 1.

Solution: Define the statement S ( n ) : un = 2 + 3n , n = 1, 2 ,...

Consider S(1) : n = 1, u1 = 2 + 3 = 5 ⇒ S (1) is true.
Consider S( 2) : n = 2, u2 = 2 + 32 = 11 ⇒ S ( 2) is true.
Let k be a positive integer, k ≥ 2 . If S ( n ) is true for all integer n ≤ k , then
n
u n = 2 + 3 , n = 1, 2 ,3, k
.
Consider S ( k +1) . As S ( n ) is true for n = 1, 2 ,3, k , we get
uk +1 = 4uk − 3uk −2 = 4( 2 + 3k ) − 3( 2 + 3k −1 ) = 2 + 4 ⋅ 3k − 3 ⋅ 3k −1 =
= 2 + 3k +1 .
Hence for k ≥ 2 , S ( n ) true for all positive integers n ≤ k implies S ( k +1) is true.
But S(1) , S( 2) are true. Therefore by induction, S ( n ) is true for all positive integers
n : un = 2 + 3n for n ≥ 1.

Problem HAR1_37.
If u1 = 8 , u2 = 20 and un = 4un −1 − 4un − 2 for n ≥ 3, show that un = ( n + 3)2 n for
n ≥ 1.

Solution: Define the statement S ( n ) : un = ( n + 3)2 n , n = 1, 2 ,... .

Consider S(1) : n = 1, u1 = 4 ⋅ 2 = 8 ⇒ S (1) is true.
Consider S( 2) : n = 2, u2 = 5 ⋅ 4 = 20 ⇒ S ( 2 ) is true.
Let k be a positive integer, k ≥ 2 . If S ( n ) is true for all integer n ≤ k , then
n
u n = ( n + 3) 2 ,n = 1, 2 ,3, k
.
Consider S ( k +1) . As S ( n ) is true for n = 1, 2 ,3, k , we get
uk +1 = 4uk − 4uk − 2 = 4( k + 3)2k − 4(( k − 1) + 3)2 k −1 = 4k 2k + 12 ⋅ 2k − 4 k 2 k −1 − 8 ⋅ 2k −1 =
= 2k +1( k + 4) .
Hence for k ≥ 2 , S ( n ) true for all positive integers n ≤ k implies S ( k +1) is true.
But S(1) , S( 2) are true. Therefore by induction, S ( n ) is true for all positive integers
n:
un = ( n + 3)2 n for n ≥ 1.

Problem HAR1_38.
If un = 3n − 2 n − 1, show that un +1 = 3un + 4 n , and hence show that un > 0 for
n ≥2.

Solution: It is easily seen that

n +1
u n +1 = 3 − 2 ( n + 1) − 1 = 3( 3 n +1 − 2 n − 1) + 6 n + 3 − 2 n − 3 =
= 3u n + 4 n .
Define the statement S ( n ) : un > 0 , n ≥ 2 ,3,... .
Consider S( 2) : n = 2, u2 = 33 − 2 ⋅ 3 − 1 = 20 > 0 ⇒ S ( 2 ) is true.
Let k be a positive integer, k ≥ 2 . If S ( k ) is true, then uk > 0 . Consider S ( k +1) ,
k ≥ 2 . As S ( k ) is true , we get
uk +1 = 3uk + 4 ⋅ k > 0 .
Hence for all positive integers k , S ( k ) true implies S ( k +1) is true. But S( 2) is
true. Therefore by induction, S ( n ) is true for all integers n≥2: un = 3n − 2n − 1 > 0 .

uk +1 = 5uk + 16 ⋅ k > 0 .

Problem HAR1_39.
If u1 = 1 and un = 2un −1 for n ≥ 2
(a) show that un < 2 for n ≥ 1,
(b) deduce that un +1 > un for n ≥ 1.

Solution: (a) Define the statement S ( n ) : un < 2 , n = 1, 2 ,... .

Consider S(1) : n = 1, u1 = 1 < 2 ⇒ S (1) is true.
Let k be a positive integer. If S ( k ) is true, then uk < 2 . Consider S ( k +1) . As S ( k )
is true , we get
uk +1 = 2uk = 2 uk < 2 2 = 2 .
Hence for all positive integers k , S ( k ) true implies S ( k +1) is true. But S(1) is true.
Hence by induction, S ( n ) is true for all integers n ≥ 1 : un < 2 .
(b) Define the statement S ( n ) : un < un+1 , n = 1, 2 ,... .
Consider S(1) : n = 1, u1 < u2 , since u1 = 1, u2 = 2 . Hence S(1) is true.
Let k be a positive integer. If S ( k ) is true, then uk < uk +1 . Consider S ( k +1) . As
S ( k ) is true , we get
uk +1 = 2uk < 2uk +1 = uk + 2 .
Hence for all positive integers k , S ( k ) true implies S ( k +1) is true. But S(1) is true.
Hence by induction, S ( n ) is true for all integers n ≥ 1: un < un+1 .

Problem HAR1_40.
ADB is a straight line with AD = a and DB = b . A circle is drawn on AB as diameter.
DC is drawn perpendicular to AB to meet this circle at C.
(i) Show that ∆ADC ||| ∆CDB , and hence show that DC = ab .
a +b
(ii) Deduce geometrically that if a >0 and b >0 , then ab ≤ .
2

Solution: Let O be the center of the circle, and r be its radius

(i) Consider the rectangular triangles ACB and CDB. These triangles have the
common angle ∠ CAB. Hence ∆ ACB are similar ∆CDB . From here
AD CD
= ⇒ CD 2
= AD ⋅ BD ;
CD BD
AD = a , BD = b ⇒ CD = ab .
a +b
(ii) AB = 2 r ⇒ r = ; OC = r and the triangle CDO is rectangular
2
a+b
⇒ OC > CD ⇒ r > ab ⇒ > ab .
2

A D O B