bl e a k C p yr g ht M o na sh U n v rs it y 20 24

e
le ta sk
ta s k C op yr ig ht M o na sh U n iv er it y 20 2 A
A sse ess sab ble e t as k C Co
s
C op yr ig ht M o na sh U n iv ers sit y 20 24 4 A ss ses ssa abl le t tasask k Co op py
t s C o y i h n i e y 2 e s b e C y
ta ask k C op pyr rig ght t MMo ona ashsh U Un niv ver rsit ity 20 02424 A Ass sses ssa abl le ta ask k C op pyr ri
sk C op yr ig ht M o na sh U n iv ers sit y 20 24
o A s s es sa bl e t tas sk C op yr ig
sk C p yr ig ht M o na sh U n iv ers it y 20 24 A ss e s sa bl e a k C op yr ig h
C op yr ig ht M o na sh U n iv ers it y 20 24 A s s e s sa bl e ta sk C op yr ig ht
C o y i h n s i e y 2 2 s e s b e t s C o y i h

fully.
C op pyr rig ght t MMo ona ash h U Un niv vers rsit ity 20 024 4 A Ass ses ssa abl le t tasask k Co op pyr rig ght t M
C op yr ig ht M o na sh U n iv ers it y 20 24 A sse ess sab ble e t as k C Co py yri igh ht M
op yr ig ht M o na sh U n iv er it y 20 2
op yr ig ht M o na sh U n iv er sit y 20 2 4 A Ass sses ssa abl le ta ask k C op pyr rig ght t MMo on
yr ig ht M o na sh U n iv er sit y 20 24 4 A ss es sa bl e ta sk C op yr ig ht M o na
s e t s

function of n.)
yr ig ht M o na sh U n iv er it y 20 24 A s s s sa bl e a k C op yr ig ht M o na s

(i) Felix gets treats.

rig igh ht MMo on nas sh Un niv iver ersi sity y 2 202 24 A As sse ess sab ble e tatasksk C Copopy yrig igh ht MMo on nas sh
(5)(i) only answers are required.

ht t M o na ash h U Un iv er sit ty 20 024 4 A ss ses ssa abl le ta sk C op yr rig ht t M o na ash h U

ht M o na sh U n iv er sit y 20 24
n e s A s s es sa bl e t tas sk
e
C op yr ig ht M o na sh U
M on as sh U ni ive rs ity y 2 202 24 A sse ess sab ble t as k C Co opy yri igh ht M on nas sh U ni
M on as h U ni ve rs ity 2 02 4 A sse ss ab le t as k C o py ri gh t M on as h U ni

equivalent to the following statements.

on as h U ni ve rs ity 2 02 4 A sse ss ab le t as k C o py ri gh t M on as h U ni ve

on as h U ni ve rs ity 2 02 4 A sse ss ab le t as k C o py ri gh t M on as h U ni ve r
n v r i A

(iii) Exactly one of the two cats gets treats.

Let t be the proposition that it is a weekend.
Let p be the proposition that the Felix is sick.
na ash h U Un iv er sit ty 20 024 4 A ss sses ssa abl le ta ask k C op pyr rig ght t MMo ona ash h U Un niv ver rsi
contradiction or neither and briefly explain why.

(ii) Sylvester gets a normal meal without treats.

C op yr ig ht M o na sh U n iv ers sit

well-behaved, but otherwise it does not get treats.

sh U n ive ers sit y 20 24

Let q be the proposition that the Sylvester is sick.

2 ss es sa ble e t tas sk
sh U n ive rs it y 0 24 A ss es sa bl t as k C op yr ig ht M o na sh U n iv ers it y
Assignment #1

U niv ive rsi ity y 2 202 24 A As sse ess sab ble e ta ask k C Co opy yrig igh ht MMo on nas sh U niv ive ersi ity y 2

U niv e rsi ty 2 02 4 A s se ss ab le ta sk
a C op
py ri h t
g t M o n a
as h U niv e rsi ty 2
h U n r 0

(p2 ∨ p3 ∨ · · · ∨ pn ) → p1 .
ni e rs ty 2 02 4

Let r be the proposition that the Felix has been well-behaved.

ni ve rs ity 2 02 4 A sse sess ssab ble le t tas sk C Co opy yri righ ht M on nas sh U ni ive ers sityty 2 202 2
s

Let s be the proposition that the Sylvester has been well-behaved.

iv ver rsit ity 20 024 4 A Ass ses ssa abl le ta ask k Co op pyr rig ght t MMo ona ash h U Un niv vers rsit ity 20 024 4
e s y 2 2 e s b e t s C y i h n s i e y 2 2
er rsit ity 20 024 4 A Ass sses ssa abl le ta ask k C op pyr rig ght t MMo ona ash h U Un niv ver rsit ity 20 024 4
s y 2 s b e t s C o y i h n i e s y 2
Assessment questions/solutions for this unit must not be posted on any website.

(i) If n = 3, then in how many rows would the sentence evaluate to true?
MAT1830 - Discrete Mathematics for Computer Science

sit ity 20 02 24 A Ass sses essa ab le ta ask k C op pyr rig ght t MMo ona ashsh U Un niv ver rsit ity 20 02424 A As
Submit by uploading a pdf to moodle by 11:55pm Wednesday in week 4

y 20 24 4 A ss es sa bl le ta sk C op yr ig ht M o na sh U n iv ers sit y 20 24
y 20 24 e s b e t s C o y i h
A sse ss ab le t as k C o py ri gh t M on as h U ni ve rs ity 2 02 4 n s i e y 2 2 A sse
A sse
20 24 A s a k p g M o n v r i A s
20 24 A ss ses ssa able le t tas sk C op yr rig ht t M o na ash h U Un iv ers sit ty 20 024 4 A ss ses ss
24
24 A ss es sa ble t as k C op yr ig ht M o na sh U n iv ers it y 20 24
o h n e y 2 A ss es sa

[No explanation required for (i). Give a brief explanation for (ii).]
[No explanation required but no partial marks for incorrect answers.]
A sse ess sab b

(ii) In general, in how many rows would the sentence evaluate to true? (Give your answer as a
(5) Let n be an integer such that n ≥ 3. Suppose that a truth table is drawn for the logical sentence
Write down propositions (using just p, q, r, s, t, brackets and logical connectives) that are logically
as well as their meals. On weekdays, each cat gets treats as well as its meal if it has been
medicated meal if it is sick and a normal meal otherwise. On weekends, both cats get treats
(4) Two cats, Felix and Sylvester, are fed every evening. On any given evening, each cat gets a
[No explanation required but no partial marks for incorrect answers.]
statement’s negation. In the negation, you may not use “if”, “then”, “implies” or similar words.
(not using logical symbols), write down the statement’s contrapositive and then write down the
(3) Consider the statement “If gcd(x, 20) = 1, then gcd(x, 2) = 1 or gcd(x, 5) = 1.” In English
(2) Use laws of logic to show that (p ∧ ¬q) ∧ q ∧ (¬q → r) is a contradiction. Explain each step
(1) Give a truth table for ¬a ∨ (a → ¬b) ↔ c. State whether the sentence is a tautology, a
Show your working and give explanations for questions (1), (2) and (5)(ii). For questions (3), (4) and

A sse ess sab ble t as k C Co py yri igh t M on as sh U ni ive rs ity 2 02 24

s
4 A As se ss ab le ta ask k C op py rig gh t MMo on as h Un niv ver rsi ty 2 02 4 A As sse ssa ab le i
a t a h U 0 s

[4]
[6]
[2]
[4]
[4]

A sse sess ssab ble le t tas sk C Co opy yri righ ht M on nas sh U ni ive ers sityty 2 202 24 4 A sse sess sab ble le t
A sse ss ab le t as k C o py ri gh t M on as h U ni ve rs ity 2 02 4 A sse ss ab le t a
ss s a le t as k p
o y r h t g M o n a h U n v r i
e s ty 2 0 4 A ss s a le t as