discrete math

4.4#9 No need to prove part b. Just do a good job explaining it.

Also #1. Define A(1) = 0, A(1) = 1, A(2) = 2, and A(n) = A(n-1) + A(n-2) + A(n-3). Prove by induction that A(n) = O(1.84^n). C=1, k=1 should work.

5.1  1bdf, 3df, 4cd, 6abc, 7ab, 8, 11b, 12, 16

    Try to do these without using a calculator.
    In all cases where a number is asked for give a brief
    explanation saying how you arrived at your number.

Thanks for installing the Bottom of every post plugin by Corey Salzano. Contact me if you need custom WordPress plugins or website design.