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, Fall 2011 Homework 3 This homework contains 4 problems worth a total of 40 points. It is due on Friday, September 16th at 4pm. When writing your proofs, be sure to use the definitions of key concepts (e.g. divisible) as presented in class. Also one goal of this problem set is to practice certain proof techniques. So be sure to use the proof technique specified by the problem instructions, even if there might be other ways to prove the claim. 1. Proof by cases [8 points] Problem 5 from Homework 2 defined the extended real numbers. An extended real number has the form a + b , where is a special new positive number whose square is zero. To compare the size of two extended real numbers, we use the definition: a + b < c + d whenever either a < c , or a = c and b < d . Using this definition and proof by cases, prove the following claim: Claim: For any extended real numbers a + b , c + d , and p + q , if a + b < c + d and c + d < p + q...
View
Full
Document
This note was uploaded on 09/19/2011 for the course CS cs173 taught by Professor Fleck during the Fall '07 term at University of Illinois, Urbana Champaign.
 Fall '07
 fleck

Click to edit the document details