Unformatted text preview: n x 1, is obtained as the sum of certain of these powers. By part (a), the number of powers involved is at most k, where 2 k1 ::; n < 2k. Since k 1 ::; 10g2 n, we know k ::; 1 + 10g2 n. 7. [BB] v'3 ~ 1.7321 as shown. 1. 7 5 3. 0 0 0 0 1 1 27 2 0 0 1 8 9 343 1 1 0 0 1 0 2 9 3462 7 1 0 0 6 9 2 4 34640 1 7 6 0 0 0 346405 1 7 6 0 0 0 0 1 7 3 2 0 2 5 2 7 9 8 5 .JI2 ~ 3.4641 as shown. 3. 4 0 12. 0 0 0 0 3 9 64 3 0 0 2 5 6 686 4 4 0 0 4 1 1 6 6924 2 8 4 0 0 2 7 6 9 6 69281 7 0 4 0 0 6 9 2 8 1 692820 1 1 1 9 0 0 I 0 1 1 1 9 0 0...
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details