Math 2053, Discrete Mathematics

Fall 2011
Solution to HW # 4


1. On ( ) { }
2
, , m n m n = = e define the following relation:

( ) ( )
1 1 2 2 1 2
, , m n m n m m s and
1 1 2 2
m n m n + s + .

Show this is a partial order on
2
.
Solution. 1. Reflexivity: Since for all natural numbers , , m n e we have m m s and
m n m n + s + so( ) ( ) , , m n m n
2. Anti-symmetry: Suppose ( ) ( )
1 1 2 2
, , m n m n and( ) ( )
2 2 1 1
, , m n m n Then by
definition of we have
1 2 2 1 1 1 2 2
, , m m m m m n m n s s + s + , and
2 2 1 1
m n m n + s + . From
here according natural numbers properties we get
2 1
m m = and
2 2 1 1
m n m n + = + , so we
have
2 1
m m = and
2 1
n n = i.e. ( ) ( )
1 1 2 2
, , m n m n = .
3. Transitivity. Suppose ( ) ( )
1 1 2 2
, , m n m n and( ) ( )
2 2 3 3
, , m n m n Then by definition of
we have
1 2 2 3 1 1 2 2
, , m m m m m n m n s s + s + , and
2 2 3 3
m n m n + s + . Now by
transitivity of s in natural numbers we have
1 3
m m s and
1 1 3 3
m n m n + s + i.e.
( ) ( )
1 1 3 3
, , m n m n .

2. Show that the following relation is an equivalence relation on.

2 5 a b a b + is divisible by 7
Solution. 1. Reflexivity: Since for every natural number , m e we have 2 5 7 m m m + =
so , m m m e .
2. Symmetry: Suppose m n , then 2 5 m n + is divisible by 7, since ( ) 7 7 m n is also
divisible by 7, so ( ) ( ) ( ) 2 5 7 7 2 5 m n m n n m + + = + is divisible by 7,
hence ( ) 2 5 n m + is divisible by 7, i.e. n m .
3. Transitivity: Suppose m n and n p . So 2 5 m n + and 2 5 n p + are divisible by 7
consequently ( ) ( ) 2 5 2 5 2 5 7 m n n p m p n + + + = + + is divisible by 7. Since 7n obviously
is divisible by 7 so 2 5 m p + is divisible by 7, i.e. m p .






3. Consider the following poset, ( ) , , where is the divisibility relation, i.e.
if m n n km = , for some k e.
Find all elements in the following interval
| | { }
3, 36 3 36 m m = e
Solution. The interval | | { }
3, 36 3 36 m m = e consists of all positive integers that
are multiple of 3 and a divisor of 36, so we have| | { } 3, 36 3, 6, 9,12,18, 36 = .
4. Consider Lexicographic relation on
2
,
( ) ( ) ( ) ( )
1 1 2 2 1 2 1 2 1 2
, , or if , then b a b a b a a a a b < = s .
Find all upper bounds, if any for ( ) { }
1, 0 A =
Solution. Let ( )
2
, u a b = e be an upper bound of A. then we must have ( ) ( ) 1, 0 , a b . To
have this by definition of , if 1 a > then ( ) ( ) 1, 0 , a b for allb e , If 1 a = ,
then( ) ( ) 1, 0 , a b if 0 b > . So the upper bound set of A is | ) ( ) { } | ) ( )
1, 1 0, .

5. Let { } 3, 4, 5, 6,18, 24, 30 A = c . For the ordering defined in problem # 3 find the
following elements if they are exist.
a. infA
b. supA
c. All maximal/minimal elements.
Solution. (a). infA = 1. This is the only natural number that is divisor of each number in
A.
(b). supA = 360. This is the smallest natural number that is divisible by each number in A.
(c). Minimal elements are 3, 4, and 5. Maximal elements are: 18, 24, and 30.