This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 173: Discrete Structures, Spring 2010 Homework 6 This homework contains 5 problems worth a total of 52 regular points. It is due on Friday, March 12th at 4pm. Since the main point of this assignment is to learn how to write proofs by induction, you must use this proof technique when the problem says to use it, even if a noninductive proof is also possible. 1. Recursive definition [12 points] Give a simple closedform definition for each of the following recursivelydefined sets. Give both a precise definition using setbuilder notation, also an informal description using a picture and/or words, and an informal explanation or work. (a) The set T Z 2 defined by: i. (1 , 1) T ii. (2 , 2) T iii. If ( x, y ) T , then ( x + 1 , y ( x + 1)) T . (b) The set S R 2 defined by: i. (3 , 4) S ii. ( 2 , 4) S iii. If ( x, y ) S and ( p, q ) S , and is any real number in the range [0 , 1], then ( x + (1 ) p, y + (1 ) q ) S ....
View
Full
Document
This note was uploaded on 11/09/2011 for the course CS 173 taught by Professor Erickson during the Spring '08 term at University of Illinois, Urbana Champaign.
 Spring '08
 Erickson

Click to edit the document details