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 anequivalence relation.
(iii) List one (1) member of each equivalence class.
The last three bits have nothing whatsoever to do with this question.
$\displaystyle 1101000~R~1101111$ but not $\displaystyle 1100000~{R}~1101000$ WHY?
In all of these strings , does each string have the same first four bits as itself? What property would that prove?