{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Assignments 2

# Assignments 2 - IV Solve the exercises 5 6 8 9 12 44 on p...

This preview shows page 1. Sign up to view the full content.

For 26.03; 6 th edition: I. Prove the assertions in examples 11 on p.81; 12 on 82; 10,11on p. 91. II. Solve the exercises 9 on p.85, and 19, 20, 28, 29, 30 on p. 162. III. Study the examples 2- 7 on pp 268- IV. 272. V. Solve the exercises 4, 5, 9, 10, 11, VI. 20, 55 on p. 279- 282 VII. Let p_1 = 2, p_2 = 3, . . . p_n = nth prime, and N be the integer obtained by taking their product and adding 1. Is N a prime number for all n? 5 th edition: I. Prove the assertions in examples 15, 19 on p.64; 12 on p.66; 26,27 on p. 69. II. Solve the exercises 25 on p.75, and 19, 20, 28, 29, 30 on p. 237. III. Study the examples 1- 6 on pp. 240-243.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: IV. Solve the exercises 5, 6, 8, 9, 12, 44 on p. 253. V. Let p_1 = 2, p_2 = 3, . . . p_n = nth prime, and N be the integer obtained by taking their product and adding 1. Is N a prime number for all n? Assignments for 09.04; 6 th ed. I. Solve the exercises 22, 24a, 25, 26, 27, 28, 30, 47, 63, 64, 65 on pp 308-310. II. Study Algorithms 6,8 on p 314-316. III. Solve the exercises 7,8,9,10, 24, 30, 36 on p 321-322. IV. Use “merge sort” to sort the list L: 4,1, 5, 8, 11, 12, 3, 7, 2, 6 in increasing order. V. Study Section 5.1 up to the “inclusion-exclusion” principle....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online