DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Instruction: Type your answers to the following questions provided by LaTeX and submit a zipped file
(included .pdf and .tex files) to E-learning by group (only 4-5 members in each group). Only team leader will
submit it. One page per problem. Please use the solution template provided. Please, summarize the work of
each member in percentage (%)

GROUP ... —- MEMBER LIST

No. Name ID Role
1
2
3
4
5

Problem 1. [5pts] Answer these questions for the partial order represented by this Hasse diagram.

1. Find the maximal elements.

2. Find the minimal elements.

3. Is there a greatest element?
4. Is there a least element?

5. Find all upper bounds of a, b, c.

6. Find the least upper bound of a, b, c, if it exists.
7. Find all lower bounds of f, g, h.
8. Find the greatest lower bound of f, g, h, if it exists

Solution:

1
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 2. [10pts]

1. Suppose that A is a nonempty set, and f is a function that has A as its domain. Let R be the relation
on A consisting of all ordered pairs (x, y) where f (x) = f (y). Show that R is an equivalence relation
on A? What are the equivalence classes of R ?
2. Let R be a reflexive relation on a set A. Show that Rn is reflexive for all positive integers n.

2
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 3. [5pts] Which of these are posets?

1. (Z, =)
2. (Z, 6=)
3. (Z, ≥)

4. (Z, -)

3
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 4. [10pts] Let R be the relation on the set A = {1, 2, 3, 4, 5} such that

(a, b)R(c, d) ⇔ a + b = c + d

1. Is R an equivalence relation?
2. What is the equivalence class of [(1,3)], [(2,4)], [(1,1)]?
3. Find the partition of set A formed by the equivalence classes of part b.

4
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 5. [10pts] Prove the following statements

1. Let R be a relation on a set A. Then R is transitive iff R ◦ R is a subset of R.

2. Suppose that R is a relation on a set A which is reflexive and transitive. Then R ◦ R = R.

5
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 6. [5pts] A domino is a flat rectangular block the face of which is divided into two square parts,
each part showing from zero to six pips (or dots). Playing a game consists of playing dominoes with a
matching number of pips. Explain why there are 28 dominoes in a complete set.

6
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 7. [10pts]

1. How many solutions are there to the equation x1 + x2 + x3 + x4 ≤ 20, where x1 , x2 , x3 , x4 are non-
negative integers? are positive integers?
2. How many solutions are there to the equation x1 + x2 + x3 + x4 = 20, where x1 , x2 , x3 , x4 are non-
negative integers with x1 ≤ 3, x2 ≥ 2, x3 > 4.

3. How many ways to arrange 30 marbles in 5 different boxes, so that box 1 has at least 5 balls, knowing
that box 2 and box 3 do not contain more than 6 balls.

7
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 8. [10pts] Given a set A = {1, 2, 3, 4, 5, 6, 7, 8, 9}.

1. From A we can create how many sequence contains 5-digit different number such that the middle
number of this sequence divisible by 5, number 5 appears only once, and a last number is an odd
number?
2. From A we can create how many sequence contains 6-digit different number such that the odd numbers
cannot stand side by side (an odd number is not next to an odd number)?
3. We can create how many odd numbers (a number includes 6-digit numbers from A) such that the
number 5 always appear twice?

8
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 9. [10pts]

1. Let A be the set contains n elements (n > 4). Assume there are 16n subsets of A that have the number
of elements is an odd number (the number of elements of each subset is an odd number). Find n?
2. Let A be the set contains n elements (n ≥ 4). Let m is the number of subsets of A which contains 4
elements, k is the number of subsets of A which contains 2 elements. Assume that m = 20k, find n?

9
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 10. [10pts] Given an equilateral triangle with the length of an edge is n. Separate this tri-
angle into n2 small equilateral triangle by using the parallel straight lines with the edges of the given
triangle. Calculate the number of parallelograms located inside the given triangle (see the figure below).

10
 DISCRETE STRUCTURE (CO1007) — Homework 04 — Relation & Counting

Problem 11. [Bonus]Solve as much as you can the exercises in Sections 6.1, - 6.4, 9.1 -9.6 in Rosens book,
7th ed. The following are recommended:

Section 9.1: 3, 7, 33, 34, 41, 47, 50, 56

Section 9.4: 16, 19, 26, 35
Section 9.5: 1, 2, 42, 44, 45

Section 9.6: 1,3,23,34,55

Section 6.1: 1, 20, 22,32, 50, 51
Section 6.2: 1, 10, 17, 22, 38

Section 6.3: 12, 18, 21, 25, 38

Section 6.4: 9, 10, 15, 20, 25, 60

11