RelationRdefined on the set of seven-bit strings bys, provided that the first four bits of_{1}Rs_{2}sand_{1}scoincide_{2}

(i) Show thatRis anequivalence relation.

(iii) Listone (1)member of each equivalence class.

Printable View

- Jun 9th 2013, 06:29 AMmuhammadjaziemRelation QuestionRelation
*R*defined on the set of seven-bit strings by*s*, provided that the first four bits of_{1}Rs_{2}*s*and_{1}*s*coincide_{2}

(i) Show that*R*is anequivalence relation.

(iii) List**one (1)**member of each equivalence class.

- Jun 9th 2013, 07:25 AMPlatoRe: Relation Question
- Jun 9th 2013, 08:20 AMmuhammadjaziemRe: Relation Question
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?

- Jun 9th 2013, 08:45 AMPlatoRe: Relation Question
The last three bits have nothing whatsoever to do with this question.

$\displaystyle 1101000~R~1101111$$\displaystyle 1100000~{R}~1101000$ WHY?*but*__not__

In all of these strings , does each string have the same first four bits as itself? What property would that prove? - Jun 9th 2013, 08:53 AMmuhammadjaziemRe: Relation Question
reflexive?

- Jun 9th 2013, 08:56 AMPlatoRe: Relation Question
- Jun 9th 2013, 09:00 AMmuhammadjaziemRe: Relation Question
but is this relation valid

1101010 R 1101000? - Jun 9th 2013, 09:11 AMPlatoRe: Relation Question
- Jun 9th 2013, 09:13 AMmuhammadjaziemRe: Relation Question
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