Week 4: Formative Task

Part A
1. Given a relation from to defined by , where .
√
a) Is ? Is ? Is ? Is ? Is ?
b) Give the domain and co-domain of the relation R.

2. Given the set and relations defined on set A as follows:

a) Represent the relation R in a directed graph.

b) By explaining from the directed graph:
Is the relation R reflexive? Symmetric? Transitive? Equivalence?

3. Given the set on which the relation is defined by .

a) Show if the set A is a poset
b) If the set A is a poset, is it a linearly ordered set?
c) Draw the Directed graph and Hasse diagram of the relation R.
d) From the directed graph, explain if the relation R is reflexive, transitive, symmetric,
asymmetric and/or equivalence.
e) From the Hasse Diagram, give the minimal and the maximal element(s) if they exist.
f) Does the least element and the greatest element exist?

4. Show that the poset of the subsets of {0,1,2}, ordered by the subset relation, is a lattice.

Part B
5. Evaluate the following
a) ∑
b) ∑

6. Given the sequences below, find for each a recurrence relation and closed formula by assuming
that the initial term is the first listed value in the sequence.
a) 20, 17, 14, 11, …
b) 162, 54 ,18 ,6 ,2 ,…

7. Solve the following recurrence relations using a convenient method for each.
a) with
b) with
c) with
d) with and

UU-MTH- 1005 Discrete Mathematics/ Formative Task Page 1