04-BS-16 · December 2014
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
National Examination, 04-BS-16 Discrete Mathematics, December 2014. Closed book; approved calculator and one double-sided aid sheet permitted. The exam instructs "answer any 10 of 12 questions, best 10 marks taken"; every question is answered below as a complete study resource.
Reference texts: Rosen, Discrete Mathematics and Its Applications, 7th ed. (Pearson) — used throughout for logic, set theory, induction, combinatorics, probability, functions, recurrence relations, graph theory, and asymptotic (Big-O) notation.
Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.
Given. Two compound propositions built from primitive statements $p,q,r$ using $\to$, $\land$, $\lor$.
Find. (a) Whether $[p\to(q\to r)]\to[(p\to q)\to(p\to r)]$ is a tautology. (b) Whether $(p\lor q)\to[q\to(p\land q)]$ is a tautology.
Approach. A compound statement in $n$ primitive variables is a tautology exactly when its truth table has "T" in every one of the $2^n$ rows, so build each table directly.
| $p$ | $q$ | $r$ | $q\to r$ | $A=p\to(q\to r)$ | $p\to q$ | $p\to r$ | $B$ | $A\to B$ |
|---|---|---|---|---|---|---|---|---|
| T | T | T | T | T | T | T | T | T |
| T | T | F | F | F | T | F | F | T |
| T | F | T | T | T | F | T | T | T |
| T | F | F | T | T | F | F | T | T |
| F | T | T | T | T | T | T | T | T |
| F | T | F | F | T | T | T | T | T |
| F | F | T | T | T | T | T | T | T |
| F | F | F | T | T | T | T | T | T |
| $p$ | $q$ | $C=p\lor q$ | $p\land q$ | $D=q\to(p\land q)$ | $C\to D$ |
|---|---|---|---|---|---|
| T | T | T | T | T | T |
| T | F | T | F | T | T |
| F | T | T | F | F | F |
| F | F | F | F | T | T |
| Part | Statement | Tautology? |
|---|---|---|
| a | $[p\to(q\to r)]\to[(p\to q)\to(p\to r)]$ | Yes |
| b | $(p\lor q)\to[q\to(p\land q)]$ | No — false at $p=F,q=T$ |