1) Suppose your calculator only did base 10 logarithms. Write an expression to compute log base 2 of 64 using only log base 10. 2) Express the following summation in closed form (an expression that can be directly computed from k). (Refer to slide 11) 3 + 5 + 7 + 9 + ... + 2k+1 3) Proof by counterexample Prove that the following statement is false: 2^n > n! for any n >= 1