机械工业离散数学英文版部分答案3_4.docVIP

Homework3 3.1: P177 Ex4: set the answer to be. For i going from 1 through n-1, computer the value of the i+1 st element in the list minus the ith element in the list. If this is larger than the answer, reset the answer to be this value. Ex27 ternary V, s, e if s e return -1 else m1 ← e-s /3 + s m2 ← 2* e-s /3 + s if V A[ m1 ] return m1 else if V A[ m2 ] return m2 else if V A[ m1 ] return ternary V, s, m1-1 else if V A[ m2 ] return ternary V, m1+1, m2-1 else return ternary V, m2+1, e 3.2: P191 Ex2 a Yes c Yes e No Ex20 The approach in these problems is to pick out the most rapidly growing term in each sum and discard the rest including the multiplicative constants . a O n3log n b O 6n c O nnn! Ex28 a Choose C1 1 and C2 2, for all x 1, we have C1*3x2 3x2+x+1 C2*3x2. Ex36 This does not follow. Let f x 2x and g x x. then f x is O g x . Now 2f x 4x, and 2g x 2x. The ratio 4x/2x 2x grows without bound as x grows—it is not bounded by a constant. 3.3: P200 Ex8 a Initially y: 3, for i 1 we set y to 7, for i 2 we set y to 15, and we are done. b There is one multiplication and one addition for each of the n passes through the loop, so there are n multiplication and n additions in all. Ex10 a 1.224*10-6 seconds b 1.05*10-3 seconds c 1.13*106 seconds d 1.27*1021 seconds 3.4: P208 Ex6 Under the hypotheses, we have c as and d bt for some s and t. Multiplying we obtain cd ab st , which means ab|cd, as desired. Ex24 Write n 2k+1 for some integer k. Then n2 4k k+1 +1. Since either k or k+1 is even, therefore n2-1 is a multiple of 8, so n21 mod 8 . 3.5: P217 Ex10 These are 1,5,7,and 11. Ex32 From ab mod m we know that b a+sm for some integer s. Now if d is a common divisor of a and m, then it divides the right-hand side of this equation, so it dived b. We can rewrite the equation as a b-sm, and then by similar reasoning, we see that every common divisor of b and m is also a divisor of a. This shows that the set of common divisors of