NivaarExam PrepOfficial exam papers ↗

04-BS-16 · Undated paper

Question 2 of 12

Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)

Notes on this paper

National Examination, 04-BS-16 Discrete Mathematics, undated sitting (May 2019). Closed book; approved Casio or Sharp calculator only. The exam instructs "answer 10 of the 12 questions"; every question is answered below as a complete study resource.

Source note: This paper is the May 2019 sitting (every page footer reads "04-BS-16/May 2019"). Two printed statements are defective as set and are flagged where they occur: Question 7(a) prints the last term of $\{1,5,9,\dots\}$ as $4n-1$ (the pattern and the stated sum require $4n-3$), and Question 8(b) prints "$n>2$" although $4^n>n^4$ fails at $n=3,4$. Question 12(c)'s parameters also make a connected graph impossible; this is noted at that part.

Reference texts: Rosen, Discrete Mathematics and Its Applications, 7th ed. (Pearson) — used throughout for logic, set theory, functions, combinatorics, probability, induction, asymptotic (Big-O) notation, and graph theory.

Question 2

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. A universally quantified quadratic inequality over $\mathbb{Z}$, a conditional with a false antecedent, a two-clause compound proposition, and a three-variable conditional.

Find. (a), (b) truth values; (c) the simplest equivalent form; (d) a proof that the conditional is a tautology.

Approach. (a) move everything to one side and complete the square. (b) evaluate the antecedent first. (c) factor out the shared disjunct with the distributive law. (d) show the antecedent is a contradiction, so the conditional can never have a true antecedent.

  1. a) $\forall n\in\mathbb{Z}\ (4n^2>4n-1)$. $4n^2-(4n-1)=4n^2-4n+1=(2n-1)^2\ge0$, with equality only at $n=\tfrac12$. Since $\tfrac12$ is not an integer, $2n-1$ is an odd integer, never $0$, so $(2n-1)^2\ge1>0$ for every integer $n$. $\boxed{\text{True}}$ (over the reals it would be false, at $x=\tfrac12$ where both sides equal 1).
  2. b) "If $2>5$ then $\forall x,\ x^2\lt x^2-5$". The antecedent $2>5$ is false. (The consequent is also false, since $x^2\lt x^2-5$ reduces to $0<-5$.) A conditional with a false antecedent is true whatever the consequent: $F\to F=\boxed{\text{True}}$.
  3. c) Simplify $(\neg p\lor q)\land(p\lor q)$. Both clauses share the disjunct $q$: $(q\lor\neg p)\land(q\lor p)=q\lor(\neg p\land p)=q\lor F=\boxed{q}$.
  4. d) Prove $(\neg(p\lor\neg q)\land\neg q)\to r$ is a tautology. By De Morgan, $\neg(p\lor\neg q)\equiv\neg p\land q$. The antecedent is therefore $$(\neg p\land q)\land\neg q\equiv\neg p\land(q\land\neg q)\equiv\neg p\land F\equiv F.$$ The antecedent is false under every assignment, so the conditional is $F\to r\equiv T$ for every value of $r$. $\boxed{\text{Tautology}}$ (confirmed on all 8 rows of $p,q,r$).
Question 2 results
PartResult
aTrue — $4n^2-4n+1=(2n-1)^2\ge1$ for every integer $n$
bTrue (vacuous: false antecedent)
c$q$
dTautology — antecedent reduces to $\neg p\land q\land\neg q\equiv F$