《离散数学》杨争锋ch07-5幻灯片资料.pptVIP

§7.5 Equivalence Relation 1. Introduction (a) Example -1 (Register for Classes) A to G 8 A.M.～11 A.M. 　　 H to N 11 A.M. to 2 P.M., O to Z 2 P.M. to 5 P.M Relation R (x,y)∈R iff x,y register at the same time Rreflexive, symmetric and transitive R divides the students into three classes (2) Examples (a) Suppose that R is the relation on the set of strings of English letters such that a R b if and only if l(a)=l(b), where l(x) is the length of the string x. Is R an equivalence relation? Solution: reflexive??? sym