\documentclass[12pt]{article} \begin{document} \centerline{Homework 2, MORALLY Due Feb 11} \newcommand{\implies}{\Rightarrow} \centerline{\bf WARNING: THIS HW IS TWO PAGES LONG!!!!!!!!!!!!!!!!!} \newif{\ifshowsoln} \showsolntrue % comment out to NOT show solution inside \ifshowsoln and \fi blocks. \begin{enumerate} \item (25 points) \begin{enumerate} \item (15 points) Write a truth table with 3 inputs and 2 outputs for the following function: $f(x,y,z) = x+y+z \pmod 3$. \item (10 points) Write a circuit for $f$ using AND, OR, and NOT using the method shown in class (do not simplify- that would make it harder for the TA's to grade!) \end{enumerate} \item (25 points) \begin{enumerate} \item (10 points) Use truth table so show that $$\neg (p \wedge q \wedge r) \equiv \neg p \vee \neg q \vee \neg r$$ (This is called {\it DeMorgan's law on three variables}.) \item (15 points) Consider the statement: $$\hbox{ for all $n$ }[\neg (p_1 \wedge \cdots \wedge p_n) \equiv \neg p_1 \vee \cdots \vee \neg p_n]$$ Prove it. Note that you cannot use Truth Table since we want it for all $n$. Do not use Induction (later when we learn induction we will do that). Use reasoning about what the truth table for both sides must look like. \end{enumerate} \centerline{GO TO NEXT PAGE FOR MORE PROBLEMS!!!!!!!!!!!!!} \newpage \item (25 points -- 5 points each) For each of the following statements write the negation without using any negations signs. \begin{enumerate} \item $x\le 4$ \item $1