0% found this document useful (0 votes)
14 views28 pages

Midterm 1 Review (Solution Part 1)

Uploaded by

dyldrm879
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views28 pages

Midterm 1 Review (Solution Part 1)

Uploaded by

dyldrm879
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 28

MIDTEM 1 REVIEW

MAT2033
QUESTION 1
▪ What is the negation of the following propositions?
▪ There are 13 items in a baker’s dozen.

▪ Selami sent more than 100 text messages every day.


QUESTION 2
▪ Let 𝑝 and 𝑞 be the propositions
𝑝: It is below freezing,
𝑞: It is snowing.
Write the propositions below using p, q logical connectives (including negation).
▪ It is below freezing and snowing.

▪ It is below freezing but not snowing.

▪ It is not below freezing and it is not snowing.

▪ It is either snowing or below freezing (or both).

▪ If it is below freezing, it is also snowing.

▪ Either it is below freezing or it is snowing, but it is not snowing if it is below freezing.


QUESTION 3
▪ Construct a truth table for (𝑝 𝑞) ⊕ (𝑝 ¬𝑞).
QUESTION 4
▪ Translate the sentence below into propositional logic.
You can graduate only if you have completed the requirements of your ma- jor and you do not owe
money to the university and you do not have an overdue library book.
Let 𝑝 : can graduate
𝑞 : completed the requirements of the major r : owe money to the university
𝑠 : no library overdue
QUESTION 5
▪ Use DeMorgan’s laws to find the negation of each of the following state- ments.
▪ Kwame will take a job in industry or go to graduate school.

▪ Yoshiko knows Java and calculus.

▪ James is young and strong.


QUESTION 6
▪ Show that 𝑝 → 𝑞 𝑎𝑛𝑑 ¬𝑞 → ¬𝑝 are logically equivalent.
QUESTION 7
▪ Find a compound proposition involving the propositional variables p, q, and r that is true when exactly
two of p, q and r are true, and is false otherwise.
QUESTION 8
▪ Translate the statements into English, where 𝑅(𝑥) is ”x is a rabbit” and 𝐻(𝑥) is ”x hops” and the domain
consists of all animals.
▪ ∀𝑥 (𝑅(𝑥) → 𝐻(𝑥)).

▪ ∃𝑥 (𝑅(𝑥) → 𝐻(𝑥)).
QUESTION 9
▪ Let 𝐶(𝑥) be the statement ”𝑥 has a cat”, let 𝐷(𝑥) be the statement ”𝑥 has a dog”, and 𝐹(𝑥) be the
statement ”𝑥 has a ferret”. Express each of these statements in terms of 𝐶(𝑥), 𝐷(𝑥), 𝐹(𝑥), quantifiers,
and logical connectives. Let the domain consist of all students in this class.
▪ A student in this class has a cat, a dog, and a ferret.

▪ Some student in this class has a cat and a ferret, but not a dog.

▪ No student in this class has a cat, a dog, and a ferret.

▪ For each of the three animals, cats, dogs, and ferrets, there is a student in this class who has this
animal as a pet.
QUESTION 10
▪ Determine the truth value of each of these statements if the domain of each variable consists of all real
numbers.
▪ ∃𝑥 (𝑥 2 = 2).

▪ ∃𝑥 (𝑥 2 = −1).

▪ ∀𝑥(𝑥 2 + 2 ≥ 1).

▪ ∀𝑥 (𝑥 2 ≠ 𝑥).
QUESTION 11
▪ Translate this statement into English, where the domain for each variable consists of all real numbers.
∀𝑥∀𝑦(((𝑥 ≥ 0) ∧ (𝑦 ≥ 0)) ⇒ (𝑥𝑦 ≥ 0))
QUESTION 12
▪ Let 𝑃(𝑥, 𝑦) be the statement ”Student 𝑥 has taken class 𝑦”, where the domain for 𝑥 consists of all students in
your class and for 𝑦 consists of all computer science courses at your school. Express each of these quantifications
in English.
▪ ∃𝑥∃𝑦𝑃(𝑥, 𝑦)

▪ ∃𝑦∀𝑥𝑃(𝑥, 𝑦)

▪ ∀𝑥∃𝑦𝑃(𝑥, 𝑦)
QUESTION 13
▪ Determine the truth value of each of these statements if the domain of each variable consists of all real numbers.

▪ ∀𝑥 ∃𝑦(𝑥 = 𝑦 2 )

▪ ∀𝑥∃𝑦(𝑥𝑦 = 0)

▪ ∀𝑥∀𝑦(𝑥 + 𝑦 ≠ 𝑦 + 𝑥)

▪ ∀𝑥(𝑥 ≠ 0 ⇒ ∃𝑦 (𝑥𝑦 = 1))

▪ ∃𝑥∃𝑦(𝑥 + 2𝑦 = 2 ∧ 2𝑥 + 4𝑦 = 5)
QUESTION 14
▪ Express the negations of each of these statements so that all negation sym- bols immediately precede
predicates.
▪ ∃𝑧 ∀𝑦 ∀𝑥 𝑇(𝑥, 𝑦, 𝑧)

▪ ∃𝑥 ∃𝑦 𝑃(𝑥, 𝑦) ∧ ∀𝑥 ∀𝑦 𝑄(𝑥, 𝑦)

▪ ∃𝑥∃𝑦(𝑄(𝑥, 𝑦) ⇔ 𝑄(𝑦, 𝑥))


QUESTION 15
▪ Find a counterexample, if possible, to these universally quantified state- ments, where the domain for all
variables consists of all integers.
▪ ∀𝑥∀𝑦(𝑥 2 = 𝑦 2 ⇒ 𝑥 = 𝑦)

▪ ∀𝑥∃𝑦 𝑦 2 = 𝑥

▪ ∀𝑥 ∃𝑦 (𝑦 2 − 𝑥 ≤ 100)
QUESTION 16
▪ For each of these arguments determine whether the argument is correct or incorrect and explain why.

▪ Everyone enrolled in the university has lived in a dormitory. Mia has never lived in a dormitory.
Therefore, Mia is not enrolled in the university.

▪ All lobstermen set at least a dozen traps. Hamilton is a lobsterman. Therefore, Hamilton sets at least a
dozen traps.
QUESTION 17
▪ Show that the square of an even number is an even number using a direct proof.
QUESTION 17
▪ Prove that if m+n and n+p are even integers, where m, n, and p are integers, then m + p is even. What
kind of proof did you use?
QUESTION 18
1
▪ Prove that if 𝑥 is irrational, then is irrational.
𝑥
QUESTION 19
▪ Prove that if 𝑥 is rational and 𝑥 ≠ 0, then 1/𝑥 is rational.
QUESTION 20
▪ how that if 𝑛 is an integer and 𝑛3 + 5 is odd, then 𝑛 is even.
QUESTION 21
▪ Prove that if 𝑛 is a positive integer, then 𝑛 is even if and only if 7𝑛 + 4 is even.
QUESTION 22
▪ Prove that there are no solutions in integers 𝑥 and 𝑦 to the equation 2𝑥 2 + 5𝑦 2 = 14.
QUESTION 23
▪ Prove the triangle inequality, which states that if 𝑥 and 𝑦 are real numbers, then |𝑥| + |𝑦| ≥ |𝑥 + 𝑦|.
QUESTION 24
▪ Prove that
1 ⋅ 1! + 2 ⋅ 2! + ⋯ + 𝑛 ⋅ 𝑛! = 𝑛 + 1 ! − 1
for every positive integer 𝑛.
QUESTION 25
▪ Find, and prove by induction, a closed formula for
1 1 1
+ + ⋯+ .
1⋅2 2⋅3 𝑛⋅ 𝑛+1
QUESTION 26
▪ Prove that 3𝑛 < 𝑛! if 𝑛 is any integer greater than 6.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy