MT131: Discrete Mathematics
Tutor-Marked Assignment (TMA) Fall 24/25
Cut-Off Date: Based on the Published Deadline.
Total Marks: …. marks turned to 15 marks
Contents
Warnings and Declaration…………………………………….………………………………......1
Marking Criteria ...…………..………………………………………………………….………..…2
Question 1 ……………….…………………………………. ………………………………...…..3
Question 2 ………………………………………………………………………………….…..…..3
Question 3 ………………………………………………………………………………….…..…..4
Question 4 ………………………………………………………………………………….…..…..4
Plagiarism Warning:
As per AOU rules and regulations, all students are required to submit their own TMA
work and avoid plagiarism. The AOU has implemented sophisticated techniques for
plagiarism detection. You must provide all references in case you use and quote
another person's work in your TMA. You will be penalized for any act of plagiarism as
per the AOU's rules and regulations.
Declaration of No Plagiarism by Student (to be signed and submitted by student
with TMA work):
I hereby declare that this submitted TMA work is a result of my own efforts and I have
not plagiarized any other person's work. I have provided all references of information
that I have used and quoted in my TMA work.
Name of Student:……………………………..
Signature:…………………………………………...
Date:…………………………………………………
MT131 / TMA Page 1 of 4 2024/2025 Fall
MT131 TMA Feedback Form
[A] Student Component
Student Name: _________________
Student Number: ____________
Group Number : _______
[B] Tutor Component
Comments Weight Mark
Q_1 8
Q_2 8
Q_3 6
Q_4 8
30
General Comments:
Tutor name:
The TMA covers only chapters 1, 2, 4, 6 and 7 and consists of four
questions for a total of 30 marks. Please solve each question in the
MT131 / TMA Page 2 of 4 2024/2025 Fall
space provided. You should give the details of your solutions and
not just the final results.
Q−1: [2+4+2 marks]
a) Determine which of the following pairs of propositional forms
are equivalent. Justify your answer without using truth tables.
i. P → ( Q ∨ R ) ,∧¬Q →(P→ R)
ii. P → ( Q ∧ R ) ,∧( P→ Q ) ∧ ( P → R )
b) Use the truth table, to prove or disprove that the following
compound proposition is a tautology: ( p ↔ q)∨(¬ p ∧ q)
c) Determine the truth value of each statement in the following.
The domain of discourse is the set of integers Z . Justify your
answers.
i. ∀ x ( x 2+ x >2)
ii. ∃ x ( x 3 +2 x=10)
Q−2: [2+2+2+2 marks]
a) Determine whether each of these statements is true or False?
i. ∅ ∈ {∅ }
ii. {1 }⊂ ∅
iii. ∅ ⊆ {∅ , 0 }
iv. {{a }}∈{a , {a }}
b) Let A={1 , 2}, B={a , b , c }, C={0 ,1 }. Find:
i. A × B ×C
ii. C × B × A
c) Show that ⌈ x ⌉=−⌊−x ⌋ .
d) For each of these lists of integers, provide a simple formula or
rule that generates the terms of an integer sequence that
MT131 / TMA Page 3 of 4 2024/2025 Fall
begins with the given list. Assuming that your formula or rule is
correct, determine the next three terms of the sequence.
i. 4 , 8 ,16 ,32 , 64 , 128 …
ii. 20 , 13 , 6 ,−1 ,−8 ,−15.. .
Q−3: [2+2+2 marks]
a) Find in set builder notation the set of all positive integers x such
that x ≡ 137(mod 5)
b) Prime factorize the numbers 1260 and 3780, then find their
greatest common divisor (GCD) and least common multiple
(LCM).
c) Encrypt the message 'HELLO WORLD' using the encryption
function f (x)=(3 x +7)mod 26 where 0 ≤ x ≤ 25.
Q−4: [5+3 marks]
a) In the following questions, assume that a “serial code” refers to
a sequence of four letters (A-Z), where letters can repeat.
i. How many codes start with B and end with Z?
ii. How many codes start with D or end with Y?
iii. How many codes start with E or F and end with W or X?
iv. How many codes start with G, H, or I, or end with X, Y, or
Z?
v. How many codes start and end with a vowel (A, E, I, O, U)?
b) Consider an experiment of flipping three fair coins.What are the
probabilities for the following events? Explain your answer.
i. The result shows exactly two heads.
ii. The result shows no heads or all heads.
iii. The result shows at least one head.
MT131 / TMA Page 4 of 4 2024/2025 Fall
