CSC 165 H1Y 1. (a) x N, y N, yx = y This is true.

Let x = 1

Homework Exercise # 3

Summer 2012

Then, x N Assume y N Then, yx = 1y = y # Math Then, y N, yx = y # Universal Introduction Then, x N, y N, yx = y # Existential Introduction (b) x N, y N, 4y = x This is false. In order to disprove the statement, we need to prove the negation. x N, y N, 4y = x x N, y N, 4y = x Assume x N Let y = x Then, y N # Since x N Then, 4y = 4x = x # Math; x > 0, since we assumed N start with 1 Then, y N, 4y = x # Existential Introduction Then, x N, y N, 4y = x # Universal Introduction Note: the above proof uses the assumption that Natural Numbers do not include 0. In the future, we will be using the denitions of Natural Numbers which do include 0. This does not change the value of the statement. The proof, however, would be a bit longer. We could use proof by cases, specifying a dierent value for y when x = 0 (try to work through this!). Alternatively, consider the following proof: Assume x N Let y = x + 1 Then, y N # Natural numbers are closed under addition Assume 4y = x Then, x = 4y = 4(x + 1) = 4x + 4 # Math Then, 0 = 3x + 4 # subtract x from both sides Then, x = 4/3 # subtract 4 from both sides, divide by 3 Then, x N # x is negative / But we assumed x N This is a contradiction. Then, 4y = x # Negation Introduction Then, y N, 4y = x # Existential Introduction Then, x N, y N, 4y = x # Universal Introduction (c) y N, x N, 4y = x This is true. Assume y N Let x = 4y Then, y N # Set of Natural Numbers is closed under multiplication, y N Then, 4y = x # substitution Then, x N, 4y = x # Existential Introduction Then, y N, x N, 4y = x # Universal Introduction

Dept. of Computer Science, University of Toronto, St. George Campus

Page 1 of 2

CSC 165 H1Y

Homework Exercise # 3

Summer 2012

(d) y N, z N, (y = 4z) (k N, y = 2k) This is true. Assume y N, z N Assume y = 4z Let k = 2z Then, k N # Set of Natural Numbers is closed under multiplication, z N Then, 2k = 2 2z = 4z # substitution, Math Then, y = 4z = 2k # assumption y = 4z Then, k N, y = 2k # Existential Introduction Then, (y = 4z) (k N, y = 2k) # Implication Introduction Then, y N, z N, (y = 4z) (k N, y = 2k) # Universal Introduction

Dept. of Computer Science, University of Toronto, St. George Campus

Page 2 of 2