1

Phn V
Quan h
RELATIONS
1. nh ngha v tnh cht
2.Biu din quan h
3.Quan h tng ng. ng d. Php
ton s hc trnZ
n
4.Quan h th t. Hasse Diagram
Relations
1. Definitions
Definition. A quan h hai ngi t tp An tp B l tp con
ca tch Descartess R A x B.
Chng ta s vit a R b thay cho (a, b) R
Quan h t A n chnh nc gi l quan h trn A
R = { (a
1
, b
1
), (a
1
, b
3
), (a
3
, b
3
) }
Example. A = students; B = courses.
R = {(a, b) | student a is enrolled in class b}
1. Definitions
2
1. Definitions
Example. Let A = {1, 2, 3, 4}, and
R = {(a, b) | a divides b}
Then R consists of the pairs:
R = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 4), (3, 3), (4,4)}
1 2 3 4
1 2 3 4
2. Properties of Relations
Definition. A relation R on a set A is reflexive(phn
x) if:
(a, a) R for all a A
Example. On the set A = {1, 2, 3, 4}, the relation:
R
1
= {(1,1), (1,2), (2,1), (2, 2), (3, 4), (4, 1), (4, 4)}
is not reflexive since (3, 3) R
1
R
2
= {(1,1), (1,2), (1,4), (2, 2), (3, 3), (4, 1), (4, 4)}
is reflexive since (1,1), (2, 2), (3, 3), (4, 4) R
2
The relation on Z is reflexive since a a for all a Z
The relation > on Z is not reflexive since 1 > 1
1 2 3 4
1
2
3
4
The relation | (divides) on Z
+
is reflexive since
any integer a divides itself
Note. A relation R on a set A is reflexive iff it contains
the diagonal of A A :
= {(a, a); a A}
2. Properties of Relations
Definition. A relation R on a set A is symmetric(i xng) if:
a A b A (a R b) (b R a)
The relation R is said to be antisymmetric(Phn xng) if:
a A b A (a R b) (b R a) (a = b)
Example.
The relation R
1
= {(1,1), (1,2), (2,1)} on the set
A = {1, 2, 3, 4} is symmetric
The relation on Z is not symmetric.
However it is antisymmetric since
(a b) (b a) (a = b)
3
(a | b) (b | a) (a = b)
Note. A relation R on a set A is symmetric iff it is self
symmetric with respect to the diagonal of A A.
1 2 3 4
1
2
3
4
The relation | (divides) on Z
+
is not symmetric.
However it is antisymmetric since
1 2 3 4
1
2
3
4
*
*
*
The relation R is antisymmetric iff the only self
symmetric parts lie on the diagonal of A A.
2. Properties of Relations
Definition. A relation R on a set A is transitive(bc
cu, truyn) if:
a A b A c A (a R b) (b R c) (a R c)
Example.
The relation R = {(1,1), (1,2), (2,1), (2, 2), (1, 3),
(2, 3)} on the set A = {1, 2, 3, 4} is transitive
The relations and |on Z are transitive
(a b) (b c) (a c)
(a | b) (b | c) (a | c)
Introduction
Matrices
Representing Relations
3. Representing Relations
Let R be a relation from A = {1,2,3,4} to B = {u,v,w}:
R = {(1,u),(1,v),(2,w),(3,w),(4,u)}.
Then we can represent R as:
The labels on
the outside are
for clarity.
Its really the
matrix in the
middle thats
important.
This is a 43-matrix whose entries indicate membership in R
0 0 1 4
1 0 0 3
1 0 0 2
0 1 1 1
w v u
Introduction
4
Definition. Let R be a relation from A = {a
1
, a
2
, , a
m
}
to B = {b
1
, b
2
, , b
n
}, then the representing matrix of R
is the m n zero-one matrix M
R
= [m
ij
] defined by
m
ij
=
0 if (a
i
, b
j
) R
1 if (a
i
, b
j
) R
Example. Let R be the relation from
A = {1, 2, 3} to B = {1, 2} such
that a R b if a > b.
Then the representing matrix of R is
Representing Relations
1 1 3
0 1 2
0 0 1
2 1
Then R consists of the pairs:
{(a
1
, b
2
), (a
2
, b
1
), (a
2
, b
3
), (a
2
, b
4
), (a
3
, b
1
), (a
3
, b
3
), (a
3
, b
5
)}
m
ij
=
1 if (a
i
, b
j
) R
0 if (a
i
, b
j
) R
Example. Let R be the relation from A = {a
1
, a
2
, a
3
} to
B = {b
1
, b
2
, b
3
, b
4
, b
5
} represented by the matrix

=
1 0 1 0 1
0 1 1 0 1
0 0 0 1 0
R
M
b
1
b
2
b
3
b
4
b
5
a
1
a
2
a
3
Let R be a relation on a set A, then the matrix M
R
that
represents R is a square matrix
R is reflexive if and only if all diagonal entries of M
R
are equal to 1: m
ii
= 1 for all i
1 0 0 w
1 1 0 v
0 1 1 u
w v u
Representing Relations
Let R be a relation on a set A, then the matrix M
R
that
represents R is a square matrix
R is symmetric if and only if M
R
is symmetric
0 1 1 w
1 0 0 v
1 0 1 u
w v u
Representing Relations
m
ij
= m
ji
for all i, j
5
Let R be a relation on a set A, then the matrix M
R
that
represents R is a square matrix
R is antisymmetric if and only if M
R
satisfies:
1 1 0 w
0 0 0 v
1 0 1 u
w v u
Representing Relations
m
ij
= 0 or m
ji
= 0 if i j
Introduction
Equivalence Relations
Representation of Integers
Equivalence Classes
Linear Congruences.
4.Equivalence Relations
Introduction
Example:
Let S = {people in this classroom}, and let
R = {(a,b): as last name starts with the same
letter as bs last name }
Quiz time:
Yes
Yes
Yes
Everyone whose
last name starts
with the same
letter as yours
belongs to your
assignment group.
Is R reflexive?
Is R symmetric?
Is R transitive?
Equivalence Relations
Quan h tng ng
Definition. A relation R on a set A is an equivalence
relation if it is reflexive, symmetric and transitive:
Example. Let R be the relation on the set of strings of
English letters such that aRb if and only if a and b
have the same length, then R is an equivalence relation
Example. Let R be the relation on R such that aRb if
and only if a b is an integer, then R is an equivalence
relation
6
Example. Let m be a positive integer and R the relation
on Z such that aRb if and only if a b is divisible by
m, then R is an equivalence relation
The relation is clearly reflexive and symmetric.
Let a, b, c be integers such that a b and b c are
both divisible by m, then a c = a b + b c is also
divisible by m. Therefore R is transitive
This relation is called the congruence modulo m and
we write
a b (mod m)
instead of aRb
Recall that if a and b are integers, then a is said to be
divisible by b, or a is a multiple of b, or b is a divisor of
a if there exists an integer k such that a = kb
Equivalence Classes
Lp tng ng
Definition. Let R be an equivalence relation on a set A ,
and a A . The equivalence class of a denoted by [a]
R
or
simply [a] is the subset
[a]
R
= {b A, b R a}
Example. What are the equivalence classes modulo 8 of 0
and 1?
Solution. The equivalence class modulo 8 of 0 contains all
integer a with the same remainder mod 8 as 0, i.e. a is a
multiple of 8. Therefore
[0]
8
={ , 16, 8, 0, 8, 16, }
Similarly
[1]
8
= {a, a has remainder 1 mod 8}
= { , 15, 7, 1, 9, 17, }
Equivalence Classes
Note. In the last example, the equivalence classes [0]
8
and
[1]
8
are disjoint.
More generally, we have
Theorem. Let R be an equivalence relation on a set A
and a, b A, then
(i) a R b if and only if [a]
R
= [b]
R
(ii) [a]
R
[b]
R
if and only if [a]
R
[b]
R
=
Note. The equivalence classes form a partition of the set
A in the sense that it divides A into disjoint subsets.
7
Let indeed a, b A, then we define a R b if and only if there
is a subset A
i
such that a, b A
i
We can prove that R is an equivalence relation on A and
[a]
R
= A
i
if and only if a A
i
Note. Let {A
1
, A
2
, } be a partition of Ainto disjoint
nonempty subsets then there is a unique equivalence
relation R on A such that the given sets A
i
are precisely
the equivalence classes.
A
1
A
2
A
3
A
4 A
5
a
b
Example. Let m be a positive integer, then there are m
different congruence classes [0]
m
, [1]
m
, , [m 1]
m
.
They form a partition of Z into disjoint subsets.
Note that
[0]
m
= [m]
m
= [2m]
m
=
[1]
m
= [m + 1]
m
= [2m +1]
m
=
[2]
m
= [m + 2]
m
= [2m + 2]
m
=

[m 1]
m
= [2m 1]
m
= [3m 1]
m
=
They are called the integers modulo m
The set of all integers modulo m is denoted by Z
m
Z
m
= {[0]
m
, [1]
m
, , [m 1]
m
}
Example. Let m be a positive integer, then we define
the two operations + and on Z
m
as follows
Theorem. The foregoing operations are well defined, i.e.
If a c (mod m) and b d (mod m), then
a + b c + d (mod m) and a b c d (mod m)
5 Linear Congruences
[a ]
m
+ [b]
m
= [a + b]
m
[a ]
m
[b]
m
= [a b]
m
Example. 7 2 (mod 5) and 11 1 (mod 5) so that
7 + 11 2 + 1 = 3 (mod 5)
7 11 2 1 = 2 (mod 5)
Note. The operations + and on Z
m
satisfy the
same property as the similar operations on Z
[a ]
m
+ [b]
m
= [b]
m
+ [a]
m
[a ]
m
+ ([b]
m
+ [c ]
m
) = ([a]
m
+ [b]
m
) +[c]
m
[a ]
m
+ [0]
m
= [a]
m
[a ]
m
+ [m a]
m
= [0]
m
,
we also write [a]
m
= [m a]
m
[a ]
m
[b]
m
= [b]
m
[a ]
m
[a ]
m
([b]
m
[c ]
m
) = ([a]
m
[b]
m
) [c]
m
[a ]
m
[1]
m
= [a]
m
[a ]
m
([b]
m
+ [c ]
m
) = [a]
m
[b]
m
+ [a]
m
[c]
m
8
Example. The linear equation on Z
m
[x]
m
+ [a]
m
= [b]
m
where [a]
m
and [b]
m
are given, has a unique solution:
[x]
m
= [b ]
m
[a]
m
= [b a]
m
Let m = 26 so that the equation [x]
26
+ [3]
26
= [b]
26
has
a unique solution for any [b]
26
in Z
26
.
It follows that the function [x]
26
[x]
26
+ [3]
26
is a
bijection of Z
26
to itself .
We can use this to define the Caesars encryption: the
English letters are represented in a natural way by the
elements of Z
26
: A [0]
26
, B [1]
26
, , Z [25]
26
For simplicity, we write: A 0, B 1, , Z 25
These letters are encrypted so that A is encrypted by
the letters represented by [0]
26
+ [3]
26
=[3]
26
, i.e. D.
Similarly B is encrypted by the letters represented by
[1]
26
+ [3]
26
=[4]
26
, i.e. E, and finally Z is encrypted
by [25]
26
+ [3]
26
=[2]
26
, i.e. C.
In this way the message MEET YOU IN THE PARK
is encrypted as
M E E T Y O U I N T H E P A R K
12 4 4 19 24 14 20 8 13 19 7 4 15 0 17 10
1 17 23 11 16 22 10 7 18 3 20 13
P H H W B R X L Q W K H S D U N
15 7 7 22
To decrypt a message, we use the inverse function:
[x]
26
[x]
26
[3]
26
= [x 3]
26
However this simple encryption method is easily detected.
We can improve the encryption using the function
f : [x]
26
[ax + b]
26
where a and b are constants chosen so that this function is a
bijection
P H H W is represented by
15 7 7 22
12 4 4 19 And hence decrypted by
M E E T
The corresponding
decrypted message is
First we choose an invertible element a in Z
26
i.e. there
exists a in Z
26
such that
We write [a ]
26
= [a]
26
1
if it exists.
The solution of the equation
[a]
26
[a ]
26
= [a a ]
26
= [1]
26
[a]
26
[x]
26
= [c]
26
is [x]
26
= [a]
26
1
[c]
26
= [ac]
26
We also say that the solution of the linear congruence
a x c (mod 26)
is x ac (mod 26)
9
Example. Let a = 7 and b = 3, then the inverse of [7]
26
is
[15]
26
since [7]
26
[15]
26
= [105]
26
= [1]
26
Now the letter M is encrypted as
[12]
26
[7 12 + 3]
26
= [87]
26
= [9]
26
which corresponds to I. Conversely I is decrypted as
[9]
26
[15 (9 3) ]
26
= [90]
26
= [12]
26
which corresponds to M.
Now the inverse function of f is given by
[x]
26
[a(x b)]
26
To obtain more secure encryption method, more
sophisticated modular functions can be used
6. Partial Orderings
Introduction
Lexicographic Order
Hasse Diagrams
Maximal and Minimal Elements
Upper Bounds and Lower Bounds
Topological Sorting
Introduction
Example Let R be the relation on the real
numbers:
a R b if and only if a b
Quiz time:
Yes
Yes
No
Is R reflexive?
Is R symmetric?
Is R transitive?
Is R antisymmetric?
Yes
Introduction
Definition. A relation R on a set A is a partial order(quan h th
t, th t) if it is reflexive, antisymmetric and transitive.
p The pair (A, ) is called a partially ordered set(tp sp
th t) or a poset
We often denote a partial order by p
Reflexive: a a p
Antisymmetric: (a b) (b a) (a = b) p p
p Transitive: (a b) (b c) (a c) p p
10
Introduction
Definition. A relation R on a set A is a partial order if it
is reflexive, antisymmetric and transitive.
Example. The divisibility relation | on the set of
positive integers is a partial ordering, i.e. (Z
+
, | ) is a poset
Reflexive?
Yes, x | x since x = 1 x
Transitive? Yes?
a | b means b = ka, b | c means c = jb.
Then c = j(ka) = jka: a | c
Antisymmetric?
a | b means b = ka, b | a means a = jb.
Then a = jka
It follows that j = k = 1, i.e. a = b
Example. The divisibility relation | on the set of
positive integers is a partial ordering, i.e. (Z
+
, | ) is a
poset
Yes?
Example. Is (Z, | ) a poset?
Antisymmetric?
No
3|-3, and -3|3,
but 3 -3.
Not a poset.
Ex. Is (2
S
, ), where 2
S
the set of all subsets of S, a poset?
Yes, A A, A 2
S
Reflexive?
Transitive?
Antisymmetric?
A B, B C. Does that mean
A C?
Yes
Yes, A poset.
A B, B A. Does that mean
A =B?
Yes
Definition. The elements a and b of a poset (S, ) are
comparable if either a b or b a .
p
p p
p A poset (S, ) such that every two elements are
comparable is called a totally ordered set(tp sp th t
ton phn)
Otherwise, they are said to be incomparable(khng so snh c).
p We also say that is a total order(th t ton phn) or a
linear order(th t tuyn tnh) on S
Example. The relation on the set of positive
integers is a total order.
Example. The divisibility relation | on the set of
positive integers is not a total order, since the elements
5 and 7 are not comparable
11
Lexicographic Order
Th t t in
Ex. A straight forward partial order on bit strings of
length n, is defined as:
a
1
a
2
a
n
b
1
b
2
b
n
if and only if a
i
b
i
, i.
With respect to this order, 0110 and 1000 are
incomparable
We cant tell which is bigger.
For many applications in computer, it is convenient to
have a total order on bit strings, or more generally on
strings of characters:
This is the lexicographic order
Lexicographic Order
Now we can verify that this is a total order on A B
called the lexicographic order
Note that if A and B are well ordered by and
respectively, then A B is also well ordered by
(a
1
, b
1
) (a
2
, b
2
) if and only if
a
1
< a
2
or (a
1
= a
2
and b
1
b
2
)
p
p
Note also that this definition can be extended to the
cartesian product of a finite number of totally ordered sets
Let (A, ) and (B, ) be two totally ordered sets. We
define a partial order on A B as follows:
p
Lexicographic Order
Recall that if is a finite set called an alphabet,
then the set of strings on , denoted by * is
defined by:
*, where denotes the null or empty
string.
If x , and w *, then wx *, where
wx is the concatenation of string w with
symbol x.
Example. Let = {a, b, c}. Then
* = {, a, b, c, aa, ab, ac, ba, bb, bc, ca, cb, cc,
aaa, aab,}
Now assume that is a total order on , then we can
define a total order on * as follows.
Let s = a
1
a
2
a
m
and t = b
1
b
2
b
n
be two strings in *
either a
i
= b
i
for 1 i m so that
t = a
1
a
2
a
m
b
m +1
b
m +2
b
n
or there exists k < m such that
a
i
= b
i
for 1 i k and
a
k+1
< b
k+1
so that
Lexicographic Order
Then s t if and only if p
s = a
1
a
2
a
k
a
k +1
a
k +2
a
m
t = a
1
a
2
a
k
b
k +1
b
k +2
b
n
p
12
For example
Example. If is the English alphabet with the usual order
on the characters: a < b < < z, then the lexicographic
order is precisely the order of the words in a dictionary
p discreet discrete
d i s c r e e t
d i s c r e t e
discreet discreetness p
d i s c r e e t
d i s c r e e t n e s s
p e t

p We can prove again that is a total order on the set

* called the lexicographic order on *
We have
Example. If = {0, 1} with the usual order 0 < 1, then *
is the set of all bit strings.
p
0110 10
0110 01100
p
p is a total order called the lexicographic order on *
Hasse Diagrams
A poset can be represented visually using a special
kind of graphs called the Hasse diagram
To define the Hasse diagram we need the concept of
direct upper bound.
We also say that a is a lower bound of b
b is said to be a direct upper bound of a if b is an upper
bound of a, and there is no upper bound c such that
Definition. An element b in a poset (S, ) is said to be
an upper bound of an element a in S if a b
p
p
b c a b c a , p p
Hasse Diagrams
Now the Hasse diagram of a finite poset (S, )
is the graph:
whose vertices are points in the plane in one-to-one
correspondence with S,
p
a
b
c
d
e
c a d b a p p p ,
two vertices a, b are joined by an arc directed from a to
b if b is a direct upper bound of a
13
Hasse Diagrams
Ex. The Hasse diagram of the poset ({1,2,3,4}, )
can be drawn as
Note. We did not draw up
arrows for the arcs by
adopting the convention
that arcs are always
directed upward
4
3
2
1
Example. The Hasse diagram of P({a,b,c})
{a,b,c}
{a,b}
{a,c}
{b,c}
{a}
{b} {c}

111
110
101
011
100
010
001
000
They look similar !!!
and the Hasse diagram of the set of bit strings of length 3
with natural bitwise order
Maximal & Minimal Elements
Consider this poset:
Each Red is maximal: there is no proper upper bound
There is no arc starting from a maximal element
There is no arc ending at a minimal element
Each Green is minimal: there is no proper lower bound
Note. In a finite poset S, maximal and minimal
elements always exist.
In fact, we can start from any element a
0
S.
a
0
a
1
a
2
The maximal elements are found in a similar way.
If a
0
was not minimal, then there exists a
1
a
0
,
and so on until a minimal element is found.
p
14
Example. What are the maximal and minimal
elements of the poset ({2, 4, 5, 10, 12, 20, 25}, | ) ?
2
4
12 20
10
5
25
Solution. From the Hasse diagram, we see that 12, 20,
25 are maximal elements
Thus the maximal and minimal elements of a poset are
not necessarily unique
and 2, 5 are minimal elements
Example. What are the maximal and minimal elements
of the poset consisting of bit strings of length 3?
Solution. From the Hasse diagram, we see that 111 is
the unique maximal element and 000 is the unique
minimal element
111 is also the greatest
element and
000 is the least element
in the sense:
111
110
101
011
100
010
001
000
for all string abc
000 abc 111 p p
In fact we have
Theorem. In a finite poset, if the maximal element is
unique, then it is the greatest element .
Similarly for the least element.
Proof. Let g be the unique maximal
element.
p a m
Therefore g is the greatest element.
Since g is unique we must
have m = g , i.e. a g
p
g
l
Similar proof for the existence of the least element l
Let a be an arbitrary element, then
a
m
there is a maximal element m such that
Upper and Lower Bounds
Definition. Let (S, ) be a partial order. If A S, then
an upper bound for A is an element x S (perhaps in
A also) such that a A, a x.
Ex. The upper bound of {g,j}
is a.
a b
d
j f
i h
e
c
g
p
p
A lower bound for A is an x S such that a A, x a
p
Why not b?
15
a b
d
j f
i h
e
c
g
Ex. The upper bounds of {g,i} are
(A) e
{a, b} has no UB.
Upper and Lower Bounds
Definition. Let (S, ) be a partial order. If A S,
then an upper bound for A is an element x S
(perhaps in A also) such that a A, a x.
p
p
A lower bound for A is an x S such that a A, x a
p
(B) c
(C) e, c, and a
a b
d
j f
i h
e
c
g
Ex. The lower bounds of {c,d} are
(A) f
NO! e, d are not
comparable
Upper and Lower Bounds
Definition. Let (S, ) be a partial order. If A S,
then an upper bound for A is an element x S
(perhaps in A also) such that a A, a x.
p
p
A lower bound for A is an x S such that a A, x a
p
(B) f, i
(C) e
{g, h} has no LB.
a b
d
j f
i h
e
c
g
Ex. The GLB of {g,j} is
(A) e, c, a
NO! they are
upper bounds
Definition. Let (S, ) be a partial order. If A S,
then the least upper bound for A is an upper bound
x such that for any upper bound y of A, y x
p
f
The greatest lower bound for A is a lower bound x
such that for any lower bound y of A, y x
p
(B) d, a
{g, j} has no lower bounds,
and hence no GLB
Ex. The LUB of {i,j} is d
NO! they are
upper bounds
a b
d
j f
i h
e
c
g
Ex. b c = f
If the least upper bound of A = {a, b} exists, then we
denote it by a b
Ex. i j = d
Similarly if the greatest lower bound of A = {a, b}
exists, then we denote it by a b
16
Topological Sorting
Consider the problem of getting dressed.
In what order
will you get
dressed while
respecting
constraints?
shoes belt jacket
swter jeans socks
uwear shirt
jwlry
Precedence constraints are modeled by a poset in which a b
if and only if you must put on a before b.
p
In other words, we will find a new total order so that a
is a lower bound of b if a b p
Recall that every finite non-empty poset has at least one
minimal element a
1
.
E.g. shirt is
a minimal
element
shoes belt jacket
swter jeans socks
uwear shirt
jwlry
Now the new set after we remove a
1
is still a poset.
Topological Sorting
Let a
2
be a minimal of the new poset.
uwear
shoes belt jacket
swter jeans socks
shirt
jwlry
Topological Sorting
E.g.
underwear
is a new
minimal
element
Now every element of this new poset cannot be a
proper lower bound of a
1
and a
2
in the original poset
This process continues until all elements are removed
We obtain a new order of the elements satisfying the
given constraints:
a
1
, a
2
, , a
m
shoes belt jacket
swter jeans socks
uwear shirt
jwlry
The arrangement of the given poset in the new
total order a
1
, a
2
, compatible with the old
order is called the Topological sorting
17
Bi tp
6. Khao sat cac tnh chat cua cac quan he R sau.
Xet xem quan he R nao la quan he tng
ng. Tm cac lp tng ng cho cac quan
he tng ng tng ng.
a) x, y R, xRy x
2
+ 2x = y
2
+ 2y;
b) x, y R, xRy x
2
+ 2x y
2
+ 2y;
c) x, y R, xRy
x
3
x
2
y 3x = y
3
xy
2
3y;
d) x, y R
+
, xRy x
3
x
2
y x = y
3
xy
2
y.
Bi tp
7. . Khao sat tnh chat cua cac quan he R sau. Xet xem
quan he R nao la quan he th t va khao sat tnh
toan phan, tnh bo phan va tm cac phan t ln
nhat, nho nhat, toi ai, toi tieu (neu co) cua cac
quan he th t tng ng.
a) x, y Z, xRy x|y;
b) x, y R, xRy x = y hay x < y + 1.
c) x, y R, xRy x = y hay x < y - 1.
d) (x, y); (z, t) Z
2
, (x, y) (z, t) x z hay (x = z
va y t);
e) (x, y); (z, t) Z
2
, (x, y) (z, t) x < z hay (x = z
va y t);
Bi tp
7. . Khao sat tnh chat cua cac quan he R sau. Xet xem
quan he R nao la quan he th t va khao sat tnh
toan phan, tnh bo phan va tm cac phan t ln
nhat, nho nhat, toi ai, toi tieu (neu co) cua cac
quan he th t tng ng.
a) x, y Z, xRy x|y;
b) x, y R, xRy x = y hay x < y + 1.
c) x, y R, xRy x = y hay x < y - 1.
d) (x, y); (z, t) Z
2
, (x, y) (z, t) x z hay (x = z
va y t);
e) (x, y); (z, t) Z
2
, (x, y) (z, t) x < z hay (x = z
va y t);
Bi tp
8. . Xet quan he R tren Z nh bi:
x, y Z, xRy n Z, x = y2
n
a) Chng minh R la mot quan he tng
ng.
b) Trong so cac lp tng ng
co bao nhieu lp oi mot phan biet?
a) Cau hoi tng t nh cau b) cho cac
lp .
1, 2, 3, 4
6, 7, 21, 24, 25, 35, 42 va 48
18
Bi tp
9. . Xet tap mau t A = {a, b, c} vi
a < b < c va cac chuoi k t:
s
1
= ccbac
s
2
= abccaa
theo th t t ien.. Hoi co bao nhieu
chuoi k t s gom 6 k t thoa
s
2
s s
1
?
Bi tp
10. THI NM 20006
Xt th t trn tp P(S)cc tp con ca tp
S ={1,2,3,4,5}trong AB nu A l tp con
ca B.
Tm mt th t ton phn trn P(S) sao
cho vi A, B trong P(S), nu AB th A B.
Tng qut ho cho trng hp S c n phn t.
Bi tp
11) 2007.C bao nhiu dy bit c di 15
sao cho 00001 s 011, trong l th t
t in.