Solution: Show that the relation R consisting of all pairs
Chapter 8, Problem 8.5.13(choose chapter or problem)
Show that the relation R consisting of all pairs (x , y) such that x and y are bit strings that agree in their first and third bits is an equivalence relation on the set of all bit strings of length three or more.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer