Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 8 - Section 8.3 - Divide-and-Conquer Algorithms and Recurrence Relations - Exercises - Page 535: 6

Answer

95.722

Work Step by Step

Result from example 5: $f(n) = 7f(n/2)+15n^2/4$ and $f(1)=1$ We have been given $32 \times 32$ matrices. Therefore in this case $n=32$ Then $f(32) = 7f(16)+15\frac{32^2}{4}$ $= 7f(16)+3840$ $ = 7(7f(8)+15\frac{16^2}{4})+3840$ $= 7(7f(8)+960)+3840$ $= 7(7[7f(4)+15\frac{8^2}{4}]+960)+3840$ $= 7(7[7f(4)+240]+960)+3840$ $= 7(7[7(7f(2)+15\frac{4^2}{4}]+240]+960)+3840$ $= 7(7[7(7f(2)+60]+240]+960)+3840$ $= 7(7[7(7[7f(1)+15\frac{2^2}{4}]+60)+240]+960)+3840$ $= 7(7[7(7[7f(1)+15]+60)+240]+960)+3840$ $= 7(7[7(7\times22+60)+240]+960)+3840$ $= 7(7\times1738+960)+3840$ $=7\times13.126+3840$ $=95.722$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.