Scribd
Upload
2 views

Assignment 1-1

This document outlines the details for Assignment 1 of Math 308: Discrete Mathematics for Spring 2025, including submission instructions and deadlines. The assignment consists of various problems related to propositions, logical connectives, truth tables, and quantifications. Students are required to complete the assignment by February 23, 2025, with penalties for late submissions.

Uploaded by

Mohamed Mahfouz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Assignment 1-1

This document outlines the details for Assignment 1 of Math 308: Discrete Mathematics for Spring 2025, including submission instructions and deadlines. The assignment consists of various problems related to propositions, logical connectives, truth tables, and quantifications. Students are required to complete the assignment by February 23, 2025, with penalties for late submissions.

Uploaded by

Mohamed Mahfouz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Math 308: Discrete Mathematics Spring 2025

Assignment 1 (100 points)

Deadline: Sunday, February 23, 2025

Instructions

• Print the assignment.


• Answer all questions.
• Clearly scan the answers.
• Submit to Google Classroom by midnight.
• Each day late will cause a deduction of 5 Points (Maximum delay
allowed: 2 days).

Name: ID:

1
1. (1 point each) Which of these are propositions? What are the truth values
of those that are propositions?

a) 4 + x = 5.

b) 2+3=7.

c) 2*8 ≥ 100.
___________________________________________________________________
2. (1 point each) Let 𝑝 and 𝑞 be the propositions

𝑝 : I bought a lottery ticket this week.


𝑞 : I won the million-dollar jackpot.

Express each of the following propositions as an English sentence.

a) 𝑝 ∧ 𝑞 b) 𝑝 ↔ 𝑞 c) ￢𝑝 → ￢𝑞

2
3. (2 point each) Let 𝑝, 𝑞, and 𝑟 be the proposition

𝑝 : You get an A on the final exam.


𝑞 : You do every exercise in this book.
𝑟 : You get an A in this class.

Write each of the following propositions using 𝑝, 𝑞, and 𝑟 and logical connectives
(including negations).

a) You get an A in this class, but you do not do every exercise in this book.

b) You get an A on the final, you do every exercise in this book, and you get an A
in this class.

c) To get an A in this class, it is necessary for you to get an A on the final.

d) You get an A on the final, but you don’t do every exercise in this book;
nevertheless, you get an A in this class.

e) Getting an A on the final and doing every exercise in this book is sufficient for
getting an A in this class.

f) You will get an A in this class if and only if you either do every exercise in this
book or you get an A on the final.

3
_________________________________________________________________

4. (2 point each) State the converse, contrapositive, and inverse of the


following conditional statement:

“I go to the beach whenever it is a sunny summer day.”

___________________________________________________________________

5. (2 points each) Construct a truth table for TWO of the following compound
propositions.

a) 𝑝 ⊕ (𝑝 ∨ 𝑞).

b) (𝑝 ∧ 𝑞) → (𝑝 ∨ 𝑞).

c ) (𝑝 ↔ 𝑞) ⊕ (𝑝 ↔ ￢𝑞).

4
___________________________________________________________________

6. (2 point each) Use De Morgan’s laws to find the negation of each of the
following statements.

a) Kwame will take a job in industry or go to graduate school.

b) Yoshiko knows Java and calculus.

5
___________________________________________________________________

7. (2 points) Show that (𝑝 ∧ 𝑞) → 𝑟 and (𝑝 → 𝑟) ∧ (𝑞 → 𝑟) are not logically


equivalent.

8. (4 points each) Show that each of these conditional statements is a


tautology in two different ways.

a) [￢ 𝑝 ∧ (𝑝 ∨ 𝑞)] → 𝑞.

b) [(𝑝 ∨ 𝑞) ∧ (𝑝 → 𝑟) ∧ (𝑞 → 𝑟)] → 𝑟.

6
9. (6 pts) Let N(x) be the statement “x has visited North Dakota,” where the
domain consists of the students in your school.

Express Three of the following quantifications in English.


a) ∃𝑥𝑁(𝑥) b) ∀𝑥𝑁(𝑥) c) ￢∃𝑥𝑁(𝑥)
d) ∃𝑥￢𝑁(𝑥) e) ￢∀𝑥𝑁(𝑥) f ) ∀𝑥￢𝑁(𝑥).

10. (6 pts) Let 𝐶(𝑥) be the statement “𝑥 has a cat”, 𝐷(𝑥) “𝑥 has a dog,” and
𝐹(𝑥) “𝑥 has a ferret.”

Express each of the following statements in terms of 𝐶(𝑥), 𝐷(𝑥), 𝐹(𝑥),


quantifiers, and logical connectives. Let the domain be all students in your
class.

a) A student in your class has a cat, a dog, and a ferret.

b) All students in your class have a cat, a dog, or a ferret.

c) Some student in your class has a cat and a ferret, but not a dog.

7
11. (4 pts) Let 𝑄(𝑥) be the statement “𝑥 + 1 > 2𝑥.” If the domain consists of
all integers, what are these truth values?
a) 𝑄(0) b) ∀𝑥 𝑄(𝑥) c) 𝑄(1) f ) ∃𝑥￢𝑄(𝑥)

12. (6 pts) Suppose that the domain of the propositional function 𝑃(𝑥) consists
of the integers −2, −1, 0, 1, and 2. Write out each of these propositions
using disjunctions, conjunctions, and negations.
a) ∃𝑥𝑃(𝑥) b) ∀𝑥𝑃(𝑥) c) ∃𝑥￢𝑃(𝑥)

8
13.(6 pts) Translate in two ways each of these statements into logic. First, let
the domain be the students in your class and second, let it be all people.

a) Everyone in your class has a cellular phone.

b) Somebody in your class has seen a foreign movie.

c) There is a person in your class who cannot swim.

14. (4 pts) Prove or disprove each of the following:

• (∀𝑥) 𝑃(𝑥 ) ∨ (∀𝑥) 𝑄 (𝑥 ) ≡ (∀𝑥) (𝑃(𝑥 ) ∨ 𝑄(𝑥 )).


• (∃𝑥) 𝑃(𝑥 ) → (∃𝑥) 𝑄 (𝑥 ) ≡ (∃𝑥) (𝑃(𝑥 ) → 𝑄 (𝑥 )).

9
15. (9 pts) Translate each of the following statements into English, where the
domain for each variable consists of all real numbers.

a) (∃𝑥) (∀𝑦) (𝑥𝑦 = 𝑦).

b) (∀𝑥) (∀𝑦) (𝑥 ≥ 0 ∧ 𝑦 < 0 → 𝑥 − 𝑦 > 0).

c) (∀𝑥) (∀𝑦) (∃𝑧) (𝑥 = 𝑦 + 𝑧).

10
16. (15 pts) Let 𝐹(𝑥, 𝑦) be the statement “𝑥 can fool 𝑦,” where the domain
consists of all people in the world. Use quantifiers to express each of the
following statements.

a) Everybody can fool Fred.

b) Everybody can fool somebody.

c) There is no one who can fool everybody.

d) Everyone can be fooled by somebody.

e) No one can fool himself or herself.

11

You might also like