{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Data Structures &amp; Alogs HW_Part_3

# Data Structures &amp; Alogs HW_Part_3 - 9 p 2q 2 = 4)2...

This preview shows pages 1–2. Sign up to view the full content.

9 2 q 2 = 4( p 2 ) 2 q 2 = 2( p 2 ) 2 This implies that q 2 is also even. Thus, p and q are both even, which contra- dicts the requirement that p and q have no common factors. Thus, 2 must be irrational. 2.17 The leftmost summation sums the integers from 1 to n. The second summa- tion merely reverses this order, summing the numbers from n 1 + 1 = n down to n n + 1 = 1 . The third summation has a variable substitution of i 1 for i , with a corresponding substitution in the summation bounds. Thus, it is also the summation of n 0 = n to n ( n 1) = 1 . 2.18 Proof : (a) Base case. For n = 1 , 1 2 = [2(1) 3 + 3(1) 2 + 1] / 6 = 1 . Thus, the formula is correct for the base case. (b) Induction Hypothesis. n 1 i =1 i 2 = 2( n 1) 3 + 3( n 1) 2 + ( n 1) 6 . (c) Induction Step. n i =1 i 2 = n 1 i =1 i 2 + n 2 = 2( n 1) 3 + 3( n 1) 2 + ( n 1) 6 + n 2 = 2 n 3 6 n 2 + 6 n 2 + 3 n 2 6 n + 3 + n 1 6 + n 2 = 2 n 3 + 3 n 2 + n 6 . Thus, the theorem is proved by mathematical induction. 2.19 Proof : (a) Base case. For n = 1 , 1 / 2 = 1 1 / 2 = 1 / 2 . Thus, the formula is correct for the base case.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}