Homework 3

Problem 1:

a) ∀ x P ( x ) → Q(x)
b) ∃ x R ( x ) →¬ Q( x)
c) ∃ x R ( x ) →¬ P (x)
d) Yes, due to Modus Tollens

Problem 2:

a) “No one has lost more than one thousand dollars playing the lottery.”
P(x) ∶=¿ person x has lost more than 1000 dollars
Universe of Discourse: people that have played the lottery
Quantifier expression : ∀ x ¬ P ( x )
Negate Expression: ∃ x P ( x )
Negated English: Someone has lost more than one thousand dollars playing the
lottery.

b) “There is a student in this class who has chatted with exactly one other student.”
P(x) ∶=¿ student x is in this class
Q(x) ∶=¿ student x has chatted with no one
R(x) ∶=¿ student x has chatted with more than one person
Universe of Discourse: students
Quantifier expression: : ∃ x P ( x ) ( ¬Q ( x ) ∧¬ R ( x ) )
Negate Expression: ∀ x ¬ P ( x ) ( Q ( x ) ∨ R ( x ) )
Negated English: All students not in this class have either chatted with no one or have
chatted with more than one person.

c) “No student in this class has sent e-mail to exactly two other students in this class.”
P(x) ∶=¿ student x is in this class
Q(x) ∶=¿ student x sent e-mails to more than 2 students
R(x) ∶=¿ student x sent e-mails to less than 2 students
Universe of Discourse: students
Quantifier expression: : ∀ x ¬ P ( x ) ( ¬ Q ( x ) ∧¬ R ( x ) )
Negate Expression: ∃ x P ( x ) ( Q ( x ) ∨ R ( x ) )
Negated English: There is some student in this class that has either sent e-mails to
more than 2 students or sent e-mails to less than 2 students.
 d) “Some student has solved every exercise in this book.”
P(x) ∶=¿ exercise x in this book
Q(x,y) ∶=¿ x exercises done by student y
Ux: exercises in this book
Uy: students
Quantifier expression: : ∃ y ∀ x P ( x ) Q ( x , y )
Negate Expression: ∀ y ∃ x ¬ P ( x ) ¬ Q ( x , y )
Negated English: All students have not done some exercises not in this book.

e) “No student has solved at least one exercise in every section of this book.”
P(x) ∶=¿ x student
Q(x) ∶=¿ x has done zero exercises
R(x,y) ∶=¿ x has done exercises in y sections
Ux: students
Uy: sections in this book
Quantifier expression: ∀ x ∀ y ¬ P ( x ) ( ¬Q ( x ) ∧ R ( x , y ) )
Negate Expression: ∃ x ∃ y P ( x ) ( Q ( x ) ∨ ¬ R ( x , y ) )
Negated English: Some students have solved zero exercises in some sections that are
not in this book.

Problem 3:

p ∶=¿ logic is difficult

q ∶=¿ many students like logic
r ∶=¿ mathematics is easy

Assumptions:
1) p ∨¬ q
2) r →¬ p

a) q → ¬r
1) r →¬ p Assume
2) p Disjunctive Syllogism of line 1
3) ¬ r → p Modus Tollens line 1 and 2
4) p ∨¬ q Assume
∴ q →¬ r NOT VALID since q cannot become antecedent
 b) ¬ r → ¬q
1) r →¬ p Assume
2) p Disjunctive Syllogism of line 1
3) ¬ r → p Modus Tollens line 1 and 2
4) p ∨¬ q Assume
5) ¬ r → ¬q Addition
∴ ¬ r → ¬q VALID

c) ¬ r ∨ p
1) p ∨¬ q Assume
2) r →¬ p Assume
3) ¬ r ∨ p ≡ r → p
∴ ¬r ∨ p NOT VALID due to line 2

d) ¬ p ∨¬ r
1) r →¬ p Assume
2) ¬ r Modus Tollens line 1
3) ¬ p Assume
4) ¬ r ∨¬ pAddition
∴ ¬ p ∨¬r VALID

e) ¬ q → ( ¬ r ∨ ¬ p )
1) p ∨¬ q Assume
2) p Disjunctive Syllogism
3) r →¬ p Assume
4) ¬ r → p Modus Tollens line 2 and 3
5)
∴ ¬q → ( ¬r ∨¬ p ) VALID

Problem 4:
Exercise 18:
n is an integer and 3n + 2 is even, then n is even

a) Assume n is odd
n = 2k + 1
3(2k + 1) + 2 = 6k + 4 + 1 = 2(3k + 2) + 1, let c = 3k + 2
2c + 1 is odd, ∴ by Contraposition, 3n+2 is even and n is even

b) Assume n is odd
n = 2k + 1
3(2k + 1) + 2 = 6k + 4 + 1 = 2(3k + 2) + 1, let c = 3k + 2
2c + 1 is odd, ∴ by Contradiction, 3n+2 is even and n is even
 Exercise 30
i. a<b
a+b
ii. >a
2
a+b
iii. <b
2

 If a = 2 and b =3, then 2 < 3 is true; 2.5 > 2 is true; 2.5 < 3 is true, therefore i ≡ ii
≡ ii.
 If a = 5 and b = 1, then 5 < 1 is false; 3 > 5 is false; 3 < 1 is false, therefore by
contraposition i ≡ ii ≡ ii.

Problem 5:

Exercise 2
Perfect Cubes less than 1000: 1, 8, 27, 64, 125, 216, 343, 512 and 729

1 + 8 != perfect cube 64 + 343 != perfect cube

1 + 27 != perfect cube 64 + 512 != perfect cube
1 + 64 != perfect cube 64 + 729 != perfect cube
1 + 125 != perfect cube 125 + 216 != perfect cube
1 + 216 != perfect cube 125 + 343 != perfect cube
1 + 343 != perfect cube 125 + 512 != perfect cube
1 + 512 != perfect cube 125 + 729 != perfect cube
1 + 729 != perfect cube 216 + 343 != perfect cube
8 + 27 != perfect cube 216 + 512 != perfect cube
8 + 64 != perfect cube 216 + 729 != perfect cube
8 + 125 != perfect cube 343 + 512 != perfect cube
8 + 216 != perfect cube 343 + 729 != perfect cube
8 + 343 != perfect cube 512 + 729 != perfect cube
8 + 512 != perfect cube
8 + 729 != perfect cube
27 + 64 != perfect cube
27 + 125 != perfect cube
27 + 216 != perfect cube
27 + 343 != perfect cube
27 + 512 != perfect cube
27 + 729 != perfect cube
64 + 125 != perfect cube
64 + 216 != perfect cube
Exercise 4
min(a,min(b,c)) = min(min(a,b),c)

Case 1: a < b ∧ b < c

Case 2: a > b ∧ b > c

Exercise 6
5x + 5y is odd when x and y are integers of opposite parity

wlog: x < y, when x is even and y is odd

5(2) + 5(3) = 25, which is odd

Exercise 8
There is a positive integer that equals the sum of the positive integers not
exceeding it.
Proof: 3
0+1+2=3=3
This was Constructive