Relation R defined on the set of seven-bit strings by s_{1}Rs_{2}, provided that the first four bits of s_{1} and s_{2} coincide
(i) Show that R is an equivalence relation.
(iii) List one (1) member of each equivalence class.
Here coincide is synonymous with same as. As such almost all such relations are equivalence relations.
You post your efforts on showing the three required properties.
For the second part, there will be sixteen strings.
hey plato thanks for the reply, I just have a doubt here....if the first four bits coincide how about the rest three? how i want to proof in matrix form if i can't determine the rest three bits?
hey plato thanks for the reply, I just have a doubt here....if the first four bits coincide how about the rest three? how i want to proof in matrix form if i can't determine the rest three bits?
The last three bits have nothing whatsoever to do with this question. but not WHY?
In all of these strings , does each string have the same first four bits as itself? What property would that prove?
thanks dude, for the reply.....i'm just confused with the last four bits....now i'm fine with it ...thanks again dude....sorry for taking your time....thank you