1. Let p be a prime number. If we know that ged(m,n) = 1 for some positive integer m, can we say that m must be a prime? (a) yes (b) no 2. Which of the following expressions equals log (2s + 1)]? (a) log, s1+2 (b) log (s+1)]+1 (c) Llog(s+1)] +1 (d) [log, s} +2 3. Let o be the Golden Ratio. Which of the following expressions is equal to na? (a) 3 - 6 (b) 4 - 26 (c) 5-30 (d) 6 - 40 4. We need to solve the Tower of Hanoi problem for n discs. It is known that to solve the Tower of Hanoi problem for n - 2 discs, we need to move the discs 511 times. How many times do we need to move the discs to solve the problem for n discs? Ans: 5. Solve the following recurrence relation A(n) = 4A(n-1)-3 with A(1) = 5. Solution