The University of Newcastle School of Electrical Engineering and Computer Science

COMP2230/6230 Introduction to Algorithmics

Tutorial Week 2
2 August 2010

Tutorial
1. For each of the following sequences, determine whether it is increasing, decreasing, nonincreasing or nondecreasing. i. 2, 3, 88, 89, 100 ii. 2, 3, 3, 88, 89, 100 iii. 2, 3, 88, 89, 3, 100 iv. 2 v. 2, 1 vi. 2, 2 2. Which of the following Boolean expressions are in the conjunctive normal form and which are in the disjunctive normal form? i. ( p ( q r ) ( p s ) ( q r ) ii. ( p q r ) ( p s ) ( q r ) s iii. iv. v.
p (q r ) q

p
pq

3. Prove the two De Morgans Laws: i. ( p q) = p q ii. ( p q) = p q

4. Simplify expressions (i.e., express without logarithms of products, powers or quotients), where log x denotes log 10 x , lg x denotes log 2 x and ln x denotes log e x .: i. log 1000 ii. log 3 35 x iii. e ln 8 iv. 2 x lg3 v. lg( x 3 2 x )
x sin x ) x+4 1 1 3 5 ( 2n 1) 5. Prove that for all n 1, 2n 2 4 6 ( 2n)

vi. log(

6. The Fibonacci sequence is defined as f 0 = 0, f1 = 1 and f n = fn-1 + fn-2 for n 2. Prove by mathematical induction that
n n 1 + 5 1 5 1 fn = 2 2 5

Workshop

1. Which sequences are both increasing and decreasing? 2. Which sequences are both nonincreasing and nondecreasing? 3. Show that p q and ( p q ) ( q p) are equivalent. 4. Simplify (i.e., express without logarithms of products, powers or quotients) : i. ln( xe 4 x ) ii. ln

x2 1 , x >1 ( x 1) 2

5. Solve each equation:

i. 100 = 50e x ii.

1 = 5 3 x 2 5

iii. ln( 2 x + 5) = 0 iv. log x 6 =

1 3

6. Use induction to prove that each equation is true for every positive integer n. i.

(2i 1) = n
i =1

ii.
More Exercises

i
i =1

n(n + 1)(2n + 1) 6

1. Write an expression equivalent to p q involving only and 2. Solve each equation: i. ln( 0.8 x + 0.03) = 0.01 ii. 0 .25 = e 0.4 x iii. lg(log 3 x) = 4 iv. 21 2 x +1 31 x = 56

operators.

3. Show that if k and n are positive integers satisfying 2 k 1 < n < 2 k , then k 1 < lg n < k , where lg n = log 2 n . 4. Prove that for real numbers a and r 1 ,

ar i =
i =0

a( r n+1 1) for all n 0 . r 1

5. Use induction to prove that each equation is true for every positive integer n.

i.

i(i + 1) =
i =1 n i =1
n

n( n + 1)(n + 2) 3

ii. iii.

i( i! ) = ( n + 1)!1
(1) i +1 i 2 =
i =1
n

( 1) n +1 n (n + 1) 2

iv.

i
i =1

=(

n(n + 1)) 2 ) 2