CSE201 Problem Set 1
CSE201 Problem Set 1
1. Logic Proofs.
1.1. Prove that a → b is equivalent to ¬b → ¬a using a truth table.
1.2. Prove it using algebraic identities.
1.3. Prove that a → b is not equivalent to b → a.
3. In Quidball, a ball game, you can score 11 points for a goal, and 7 for a near miss. Prove
that you can achieve any score greater than 60. Think inductively and experiment.
4. Prove by induction that there are 2n possible rows in a truth table with n variables.
5. In the restroom of The Prancing Pony, an inn located in Bree, there is a sign that reads:
“Please do not leave valuables or magic rings unattended”. Assuming that a magic ring
is considered a valuable, prove using formal logic, that the sentence “Please do not
leave valuables unattended” is equivalent to the sign in the restroom. Prove that “Please
do not leave magic rings unattended” is not equivalent.
6. Prove that a|b (a nand b) , which is defined to be ¬(a ∧ b), is complete. Write (a→b)→b
using just | (nand), then using just ↓ (nor).
7. Show how to use a truth table in order to construct a conjunctive normal form for any
Boolean formula W. [Hint: Consider the disjunctive normal form for ¬W].
8. You have proved before that a truth table with n variables has 2n rows.
8.1. How many different Boolean functions with n variables are there?
8.2. For n=2, list all the functions and identify as many as you can by name.
11. Use logic with quantifiers and predicates to model the following three statements:
All students are taking classes. Some students are not motivated. Some people taking
classes are not motivated.
Prove that the third statement follows logically from the first two. (Reminder: You must
take the conjunction of the first two statements and the negation of the third, and derive
a contradiction.)
12. The following algebraic idea is central for Karnaugh maps. Karnaugh maps are a method
of minimizing the size of circuits for digital logic design.
12.1. Using algebraic manipulation, prove that the two Boolean formulae below are
equivalent. [Hint: x(a+¬a) is equivalent to x].
¬yx + ¬zy + ¬xz and ¬xy + ¬yz + ¬zx
12.2. Verify your results using a truth table.
13. The exclusive-or operator ⊕, is defined by the rule that a ⊕ b is true whenever a or b is
true but not both.
13.1. Calculate x ⊕ x, x ⊕ ¬x, x ⊕ 1, x ⊕ 0.
13.2. Prove or disprove that x + (y ⊕ z) = (x + y) ⊕ (x + z)
13.3. Prove or disprove that x ⊕ (y + z) = (x ⊕ y) + (x ⊕ z)
13.4. Write conjunctive normal form and disjunctive normal form formulae for x ⊕ y
13.5. The exclusive-or operator is not complete. Which ones, if any, of the three
operators {and, or, not} can be combined with exclusive-or to make a complete
set?
14. The nth triangle number Tn is defined to be the sum of the first n integers.
14.1. Prove by induction that Tn = n(n+1)/2.
14.2. Prove algebraically using (14.1), that n3 + (1+2+…+(n-1))2 = (1+2+…(n-1) + n)2
14.3. Using (14.2) guess a formula for 13 + 23 + 33 + … + n3 , and prove it by induction.
15. Guess a formula for the sum below, and prove you are right by induction.
1 + 1(2) + 2(3) + 3(4) + … + n(n+1)