UiTM CAWANGAN PERLIS

MAT 222

MATHEMATIC LOGIC PROVING TECHNIQUES

PAST YEAR QUESTION (JANUARY 2018)

GROUP 3

STUDENT NAME STUDENT ID GROUP

NOR SHAMIRA BINTI ZABRI 2019276894 RCS1433E

WAN NURUL NADIAH BINTI WAN MAKHTAR 2019200282 RCS1433E

HANNANI HANIN BINTI POZLAN 2019446814 RCS1433E

NURALIA SYUHADA BINTI NORISHAM 2019409534 RCS1433F

NURUL AIN BINTI MOHAMAD ZAINUDDIN 2019420846 RCS1433F

PREPARE FOR: SIR FAZRIL IZHAR

SEPTEMBER – JANUARY 2020

QUESTION 1
a) Given the universal set U = {𝑥|𝑥 ∈ 𝑍 + , 𝑥 ≤ 25} and the set
𝑥
P= {3 ∈ 𝑍 + |𝑥 ≤ 25}

Q= {𝑥 ∈ 𝑍 + |𝑥 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 5}

R= {𝑥 ∈ 𝑍 + | 𝑥 𝑖𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟}

i) List the elements of sets P, Q and R.

Solution:

1 2 4 5 7 8 10 11 13 14 16 17 19 20
, , 1, , , 2, , , 3, , , 4, , , 5, , , 6, , ,
3 3 3 3 3 3 3 3 3 3 3 3 3 3
P:{ 22 23 25 }
7, , , 8,
3 3 3

Q: {5,10,15,20,25}

R: {2,4,6,8,10,12,14,16,18,20,22,24}

ii) List of the elements of P \ (Q ∪ R)

Solution:

𝑃\(𝑄 ∪ 𝑅)
𝑃 ∩ (𝑄 ∪ 𝑅)′
𝑃 ∩ {1,3,7,9,11,13,17,19,21,23}
{1,3,7}

iii) Find |𝑄 ′ ∩ (𝑃 ∪ 𝑅)′ |

Solution:

𝑄 ′ ∩ (𝑃 ∪ 𝑅)′
𝑄 ′ ∩ {9,11,13,15,17,19,21,23,25}
{9,11,13,17,19,21,23}

∴ |𝑄 ′ ∩ (𝑃 ∪ 𝑅)′ | = 7
b) Rihanna surveyed college students about how they communicated with their friends over
the previous weeks by percentage.

66% of the students used e-mail.

76% of the students used text messages.
34% of the students used social networks.
56% of the students used e-mail and text messages.
18% of the students used e-mail and social networks.
19% of the students used text messages and social networks.
12% of the students used all three types of communication.

i) Present the above information in a Venn diagram.

Solution:

Text messages
e-mail

44% 13%
4%

12%
6% 7%

5% 9%

Social networks
 ii) Determine the percentage of students who used at least one of these three types
of communication.

Solution:

4% + 13% + 9% = 26%
⸫ 26% students used at least one of the three types of communication.

iii) How many students do not use any of the three types of communication, if this
survey involves 120 college students?

Solution:
.
100-(4+12+44+13+7+6+9) =100-95=5%

5
× 120 = 6
100

⸫6 students do not use any of the three types of communication.

c) State the steps and reasons using the laws of set theory.

[(𝐴 ∪ 𝐵) ∖ (𝐵 ∖ 𝐴)] ∖ 𝐶

Solution:

[(𝐴 ∪ 𝐵) ∖ (𝐵 ∖ 𝐴)] ∖ 𝐶
[(𝐴 ∪ 𝐵) ∩ (𝐵 ∩ 𝐴′ )′] ∩ 𝐶 ′ - Definition of Substraction
[(𝐴 ∪ 𝐵) ∩ (𝐵′ ∪ 𝐴′′ )] ∩ 𝐶 ′ - Demorgan’s Law
[(𝐴 ∪ 𝐵) ∩ (𝐵′ ∪ 𝐴)] ∩ 𝐶 ′ - Double Complement Law
[(𝐴 ∪ 𝐵) ∩ (𝐴 ∪ 𝐵′)] ∩ 𝐶 ′ - Commutative Law
[𝐴 ∪ (𝐵 ∩ 𝐵′)] ∩ 𝐶 ′ - Distributive Law
[𝐴 ∪ ∅] ∩ 𝐶 ′ - Inverse Law
𝐴 ∩ 𝐶′ - Identity Law
QUESTION 2

a) Consider the implication.

“If I go to the store, then I will get a soda.”

i. State the implication using “only if”.

Solution:

p: I go to the store

q: I will get a soda

(p→q) : I go to the store only if I will get a soda.

ii. State the implication using “if”.

Solution:

p: I go to the store

q: I will get a soda

(p→q) : I go to the store if I will get a soda.

iii. State the converse of the implication in words.

Solution:

p: I go to the store

q: I will get a soda

(q→p) : If I will get a soda, then I go to the store.

iv. State the implication as a disjunction.

Solution:

p: I go to the store

q: I will get a soda

(p v q) : I go to the store or I will get a soda.

 v. State the negation of the implication as a conjunction.

Solution:

p: I go to the store

q: I will get a soda

negation of the implication:

(~p→~q) : If I do not go to the store, then I will not get a soda.

negation of the implication as a conjunction:

(~p ∧ ~q) : I do not go to the store and I will not get a soda.

b) Fill in the blanks with the correct answers.

i. If a sentence can be classified as true or false, it is called a proposition .

ii. The if-statement p in the implication p→q is called the hypothesis while the
then-statement q is called conclusion .
QUESTION 3
a) Determine whether the following proposition is a tautology, a contradiction or a
contingency using a truth table.

¬ (a → b) ↔ c
Solution:

a b c ¬a ¬b ¬ (a →b) ¬ (a → b) ↔c

T T T F F T T

T T F F F T F

T F T F T T T

T F F F T T F

F T T T F F F

F T F T F F T

F F T T T T T

F F F T T T F

❖ Contingency

b) State the steps and reasons using the laws of logic with your final answer in implication
form.

(p ˅ q) ˄ [q ˅ (¬ s ˅ (r ˄ ¬ r ))]

Solution:

(p ˅ q) ˄ [q ˅ ( ¬ s ˅ (r ˄ ¬ r))]

(p ˅ q) ˄ [q ˅ ( ¬ s ˅ F0 )] - Inverse law

(p ˅ q) ˄ (q ˅ ¬ s) - Identity law

[(p ˅ q) ˄ q] ˅ ¬ s - Associative law

q˅¬s - Absorption law

¬s˅q - Commutative law

s→q - Definition of Implication

QUESTION 4
a) Consider the following statement where the universal set is the set of all integers.
“For every a, there exists b such that ab ≤ 2”

i) Express the statement in symbolic form.

∀𝑎 ∃𝑏 (𝑎𝑏 ≤ 2)

ii) Determine the truth value and negate the given statement.

True. Example, when 𝑎 = −1, 𝑏 = −1

There exists a, for every b such that ab > 2,
∃𝑎 ∀𝑏 (𝑎𝑏 > 2)

b) Determine the truth value of the following quantified statements where the universal set
is the set of all integers. Explain your answer by giving an example or a counterexample.

i) ∀𝑥 ∀𝑦 (4 − 𝑥 2 < 𝑦)

False. Counterexample, when x=1, y=1

ii) ∃𝑥 ∃𝑦 ∋ (4 − 𝑥 2 < 𝑦)

True. Example, when x=2, y=1

iii) ∀𝑥 ∃𝑦 ∋ 𝑥 2 < 𝑦

False. Counterexample, when x=2, y=2

QUESTION 5

Consider the following arguments:

Sofia works part time or full time.

If Sofia does not play on the team, then she does not work part time.

If Sofia plays on the team, she is busy.

Sofia does not work full time.

i. Write the primary statement using variables p, q, r and s.

Solution:

p = Sofia works part time.

q = Sofia works full time.
r = Sofia plays on the team.
s = Sofia is busy.

ii. Write all the premises using the variables in (i).

Solution:
1. p v q -------- premises
2. ~r → ~p ---- premises
3. r → s -------- premises
4. ~q ------------ premises

iii. Determine the conclusion of the argument using the rules of inference.
Solution:

1. p v q -------- premises
2. ~ r → ~ p -- premises
3. r → s -------- premises
4. ~ q ----------- premises
5. p ------------- 1,4 Rules of disjunctive syllogism
6. r -------------- 2,5 Modus Tollens
7. s -------------- 3,6 Modus Pones
The conclusion is “Sofia is busy”.
QUESTION 6

Prove using the Forward - Backward Method.

If f : X → X and g : X → X are both one-to-one functions, then f ○ g is one-to-one.

Show the analysis of proof and the condensed proof.

[Hint: A function f : A → B is said to be one-to-one if and only if f(x1) = f(x2) implies that x1=x2 for
all x1,x2 in A]

Solution:

analysis of proof:

A: f : X → X and g : X → X are both one-to-one functions

B: f ○ g is one-to-one

B1: If f ○ g ( x ) = f ○ g ( y ), then x = y.

B2: x = y

A1: f(g(x)) = f(g(y))

A2: g(x) = g(y)

A3: x = y

∴ A3 ⇔ B2

condensed proof:

From the hypothesis, suppose that the f:X → X and g:X → X are both one-to-one are given.
To show the conclusion f o g is one-to-one, we will assume that f o g ( x ) = f o g ( y ), then x =
y.
Thus, f(g(x)) = f(g(y) and since f is one-to-one, let g(x) = g(y).
Then the g is also one-to-one x = y.
Therefore, f o g is one-to-one.
QUESTION 7
Prove the following proposition using the Specialization Method.
If R is a subset of a set S of real numbers and w is an upper bound for S, then w is an upper
bound for R.
Give the analysis of proof and the condensed proof.
[ Hint: A real number w is an upper bound for a set T if for all elements t in T, t ≤ u]

Solution:
analysis of proof:

A: R is a subset of a set S of real number and w is an upper bound for S.

B: w is an upper bound for R.
B1: For all elements r in R, r ≤ w.
A1: Choose an element say r’ in R.
B2: r’ ≤ w.
A2: For all element x in R, x is in S.
Specialize A2 to r’, (r’ is in R)
A3: r’ is in S.
A4: For all element s in S, s ≤ w.
Specialize A4 to r’, (r’ is in S)
A5: r’ ≤ w.
A5 ⇔ B2

Condensed proof:
To show that w is upper bound for R, let r be an element of R. From the hypothesis R is a
subset of S and so r’ is also an element of S. Also, from the hypothesis, w is an upper bound for
S. Thus, for every element s in S, s ≤ w, since r’ ∈ S, therefore r’ ≤ w. Hence w is an upper
bound for R.
QUESTION 8

Prove using the Contrapositive Method.

If 𝑛3 + 2n + 1 is odd, then n is even.

Show the analysis of proof only.

Solution:

A: 𝑛3 + 2n + 1 is odd

B: n is even

A1: n is odd (not B)

B1: 𝑛3 + 2n + 1 is even (not A)

B2: 𝑛3 + 2n + 1 = 2a, a ∈ Z

A2: n = 2k + 1 (definition odd number)

A3: 𝑛3 + 2n + 1 = (2k + 1)3 + 2(2k + 1) + 1

= 8𝑘 3 + 12𝑘 2 + 6k + 1

= 2 (4𝑘 3 + 6𝑘 2 + 5𝑘 + 2)

Let a: 4𝑘 3 + 6𝑘 2 + 5𝑘 + 2

2a = 2 (4𝑘 3 + 6𝑘 2 + 5𝑘 + 2)

A4: 𝑛3 + 2n + 1 = 2a, a ∈ Z

A4  B2
QUESTION 9

Prove the following using the Contradiction Method.

𝐼𝑓 𝑎 ≥ 2 𝑎𝑛𝑑 𝑏 𝑎𝑟𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟, 𝑡ℎ𝑒𝑛 𝑎 ∤ 𝑏 𝑜𝑟 𝑎 ∤ (𝑏 + 1)

Show the analysis of proof only.

Solution:

A: 𝑎 ≥ 2 𝑎𝑛𝑑 𝑏 𝑎𝑟𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟

B: 𝑎 ∤ 𝑏 𝑜𝑟 𝑎 ∤ (𝑏 + 1)

A1: 𝑎|𝑏 𝑎𝑛𝑑 𝑎|(𝑏 + 1) (NOT B)

A2: 𝑏 = 𝑘𝑎 𝑎𝑛𝑑 𝑏 + 1 = 𝑚𝑎

A3: 𝑏 + 1 = 𝑘𝑎 + 1

A4: 𝑘𝑎 + 1 = 𝑚𝑎

1 = 𝑚𝑎 − 𝑘𝑎

1 = 𝑎(𝑚 − 𝑘)

1
𝑎= , 𝑎<2
𝑚−𝑘

A5: 𝑎 < 2 𝑎𝑛𝑑 𝑏 𝑎𝑟𝑒 𝑛𝑜𝑡 𝑖𝑛𝑡𝑒𝑔𝑒𝑟

⸫A5 contradicts with A

QUESTION 10

Prove the following statement is true for all positive integers n using Mathematical Induction.

∑ 𝑖(2𝑖 ) = 2 + (𝑛 − 1)2𝑛+1
𝑖=1

Solution:

1. Show that P (1) is true:

LHS:

𝑃(1) = ∑ 𝑖(2𝑖 ) = 1(21 ) = 2

𝑖=1

RHS:

P (1) = 2 + (1 − 1)21+1 = 2

LHS = RHS

⸫ P (1) is true.

2. Assume that P(n) is true:

∑ 𝑖(2𝑖 ) = 2 + (𝑛 − 1)2𝑛+1
𝑖=1

3. Check true for P(n+1):

RHS:

P(n+1) = 2 + ((𝑛 + 1) − 1)2(𝑛+1)+1

= 2 + (𝑛)2𝑛+2 = 2 + 2𝑛𝑛+2

LHS:

𝑛+1

𝑃(𝑛 + 1) = ∑ 𝑖(2𝑖 ) + (𝑛 + 1)(2𝑛+1 )

𝑖=1

= (2 + (𝑛 − 1)2𝑛+1 ) + (𝑛 + 1)(2𝑛+1 )
 = 2 + 2𝑛𝑛+1 − 2𝑛+1 + 2𝑛𝑛+1 + 2𝑛+1

= 2 + 2𝑛𝑛+2

⸫ 𝑃(𝑛 + 1)𝑖𝑠 𝑡𝑟𝑢𝑒.

Therefore, for all positive integers, ∑𝑛𝑖=1 𝑖(2𝑖 ) = 2 + (𝑛 − 1)2𝑛+1