Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
26 views2 pages

Maths Assignmet

The document contains 5 questions regarding set theory, functions, sequences, relations and logic. Question 1 contains parts on Venn diagrams and set identities. Question 2 covers relations and their representations. Question 3 is about functions, their domains, ranges and composition. Question 4 deals with arithmetic and geometric sequences. Question 5 covers binary relations, logical equivalence and translating statements to symbolic logic.

Uploaded by

Godknows Kambuzuma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views2 pages

Maths Assignmet

The document contains 5 questions regarding set theory, functions, sequences, relations and logic. Question 1 contains parts on Venn diagrams and set identities. Question 2 covers relations and their representations. Question 3 is about functions, their domains, ranges and composition. Question 4 deals with arithmetic and geometric sequences. Question 5 covers binary relations, logical equivalence and translating statements to symbolic logic.

Uploaded by

Godknows Kambuzuma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment 1 (100 Marks)

Please submit a pdf


Question 1:

a) Use a Venn diagram to represent the following (Shade the wanted region):
(i) (A  B)  Cc [4]
(ii) Ac  (B  C) [4]
(iii) (A – B)  C [4]
(iv) (A  Bc)  Cc [3]
b) USING SET IDENTITIES: For all subsets A and B of a universal set U, prove that
(A – B)  (A  B) = A [5]
Question 2:
a) Let A = {1, 2, 3, 4} and define relations R1, R2, R3, R4 on A as follows:
R1 = {(1, 1), (3, 3), (2, 2), (4, 4)}
R2 = {(1, 1), (1, 4), (2, 2), (3, 3), (4, 3)}
R3 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)}
R4 = {(1, 3), (2, 2), (2, 4), (3, 1), (4, 4)}
i) Draw the Directed Graphs for the relations R1, R2, R3, and R4. [4]
ii) From the graphs in (i) determine if the given relation is reflexive and give the
reason. [8]
b) If A = {2, 4, 6, 9} and B = {4, 6, 18, 27, 54}, a ∈ A, b ∈ B, find the set of ordered
pairs such that 'a' is factor of 'b' and a < b. [4]
c) Let A = {1,2,3} and define relation R = {(1,1), (1,3), (2,2), (3,2), (3,3)}.
i) Find the Matrix Representation M of the relation R. [2]
ii) Use matrix M in (i) to determine the type of the relation and give a reason. [2]
Question 3:
a) Determine the range of the functions f, g, h from X = {2,4,5} to Y = {1,2,4,6} defined
as: f = {(2,6), (4,1), (5,6)}
g = {(2,6), (4,2), (5,1)}
h: h(2) = 4, h(4) = 4, h(5) = 1. [6]
b) Find all one-to-one functions from X = {a,b} to Y = {u,v}. [2]
3
c) Given f(x) =x3+1 and g(x) = √3𝑥 − 1, find (f○g)(4). [6]
d) Which of the following arrow diagrams define onto functions? Give reason. [4]

2𝑥 3 +2𝑥
e) Define functions f and g from R to R by formulas: f(x) = 2x and g(x) = for all
𝑥 2 +1
x εR. Show that f = g. [2]
Question 4:
a) Write the first four terms of the sequence defined by the formula bk = 1 + 2k, for all
integers k  0. [4]
b) Find the 20th term of the arithmetic sequence 3, 9, 15, 21, … [5]
c) Find the 8th term of the following geometric sequence 4, 12, 36, 108, … [5]
d) If t = aab and e = cabd, then find te and et. [3]
e) Which term of the geometric sequence is 1/8 if the first term is 4 and common ratio
½. [3]
Question 5
a) Let A = {1, 2, 3, 4} and R = {(1,1), (2,2), (2,4), (3,3), (4,2), (4,4)} be a binary relation
on A. Prove if R is an Equivalence Relation. [5]
b) Demonstrate That p ∨ (q ∧ r) and (p ∨ q) ∧ (p ∨ r) Are Logically Equivalent. [7]
c) Translate the following compound statements to symbolic form using p and q:
i) “I will go only if he stays.” [1]
ii) “Birds fly if and only if sky is clear.” [2]
iii) “It is false that he is poor and not honest.” [3]
iv) “I will not go to class unless you come.” [2]

You might also like