Scribd
Upload
289 views3 pages

Homework Assignment 1 PDF

This document outlines 15 homework problems in discrete mathematics. The problems cover topics such as propositional logic, quantifiers, logical equivalences, rules of inference, and different proof techniques including direct proof, indirect proof, and proof by contradiction. Students are asked to encode statements using logic symbols, determine if statements are tautologies, prove statements using logical steps, and determine conclusions that can be drawn from sets of conditional statements.

Uploaded by

Harjuno
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
289 views3 pages

Homework Assignment 1 PDF

This document outlines 15 homework problems in discrete mathematics. The problems cover topics such as propositional logic, quantifiers, logical equivalences, rules of inference, and different proof techniques including direct proof, indirect proof, and proof by contradiction. Students are asked to encode statements using logic symbols, determine if statements are tautologies, prove statements using logical steps, and determine conclusions that can be drawn from sets of conditional statements.

Uploaded by

Harjuno
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/ 3

Homework Assignment 1

Discrete Mathematics (3 Credits)


Information Systems Department FTIf – ITS

Materials : Logic, Rules of Inference, Proofs


Name :
Student Id : Class :

1. Define and explain the difference between a proposition and a


propositional variable.

2. Define and explain the difference between a proposition and a


propositional function.

3. Encode the following statement using quantifiers and propositional


functions (of one or two variables). Clearly label what your propositional
functions and variables represent.

“There is a building on campus of some college in the United States in


which every room is painted white.”

4. Use De Morgan’s laws to find the negation of each of the following


statement:
a) Kate will take a job in industry or go to graduate school.
b) John knows Java and Calculus.
c) James is young and strong.
d) Rica will move to Oregon or Washington.

5. Using logical equivalences, prove that (pq)((qp)) is a tautology.


In other words, show that (pq)((qp))T .You must clearly label
each step!

6. Determine whether [ p  (p  q)]   q is a tautology. Clearly label


each step of your answer.

7. Show that each of these conditional statements is tautology without


using truth table.
a) [ p  (p  q)]  q
b) [ (p  q)  (q  r)]  (p  r)
c) [p  (p  q)]  q
d) [(p  q)  (p  r)  (q  r)]  r

8. Prove that ( p ∧ ( p ∧ q)) ∧ (￢p ∨ q) ≡ ( p ∧ q) using logical equivalences.


You must clearly label each step of the logical equivalence.
9. Given the three propositions p, (q p), r q , can we conclude r?
Show this by using rules of inference. You must label all your steps!

10. Consider the following four statements. Note that, for this example, the
negation of “richly colored” is “dully colored”, and “small” means the
same as “not large”.
1) All hummingbirds are richly colored
2) No large birds live on honey
3) Birds that do not live on honey are dull in color
4) Hummingbirds are small

a) Express each of the four statements using quantifiers and


propositional functions. Clearly label what your propositional functions
represent, as well as your universe of discourse. Your universe of
discourse must be the same for all the quantified statements.
b) If they are not already, convert the quantified statements to use only
one universal quantifier per statement (for example, x(P(x)Q(x))). If
you don’t remember how to convert existential quantified statements
into universally quantified statements, then try rephrasing the above
sentences using only universal quantifiers.
c) As all the statements in (b) now use one universal quantifier, we
convert them to use only propositions. For example, x(P(x)Q(x))
would become pq . Express these statements using only
propositions. If you did not get part (b), try restating the sentences
using propositions.
d) If you are given that the first three statements from part (c) are true,
can you conclude the fourth statement? Prove this using logical
equivalences and rules of inference. Clearly label what rule you are
using on each step.

11. A pirate famous for his bizarre sense of humor and love of logic puzzles
left the following clues as to the location of the treasure. The treasure
can only be in one place.
a) If the house is next to a lake, then the treasure is in the kitchen
b) If the house is not next to a lake or the treasure is buried under the
flagpole, then the tree in the front yard is an elm and the tree in
the back yard is not an oak
c) If the treasure is in the garage, then the tree in the back yard is
not an oak
d) If the treasure is not buried under the flagpole, then the tree in the
front yard is not an elm
e) The treasure is not in the kitchen
Using rules of inference, determine where the treasure is hidden. You
must clearly state what your propositional variable represent and which
rule of inference is used for each step.
12. Consider the following statements.
a) If Dominic goes to the racetrack, then Helen will be mad.
b) If Ralph plays cards all night, then Carmela will be mad.
c) If either Helen or Carmela gets mad, then Veronica (their
attorney) will be notified.
d) Veronica has not heard from either of these two clients.
From these, can we conclude that Dominic didn’t make it to the
racetrack and Ralph didn’t play cards all night?
Write each of these statements in symbolic form. Clearly label what
your variables represent! Then establish the validity of the conclusion.
You must clearly label which rule of inference is used for each step.

13. Consider the statement: “The sum of any even integer and any odd
integer is odd”
a) Restate this (in English) as a conditional
b) Prove it via an indirect proof XOR a proof by contradiction

14. Prove or disprove each of the following statements. Clearly state which
proof method you are using.
a) There are three consecutive odd integers that are primes, that is,
odd primes of the form p, p+2, p+4.
b) n2-1 is composite whenever n is a positive integer greater than 1.
c) If n is a positive integer such that the sum of its divisors is n+1, then
n is prime.

15. Prove that if m is an even integer, then m+7 is an odd integer. You
need to prove it three different ways: by direct proof, indirect proof,
and proof by contradiction.

You might also like