Let R be the relation consisting of all pairs (x , y) such
Chapter 8, Problem 8.5.14(choose chapter or problem)
Let R be the relation consisting of all pairs (x , y) such that x and y are strings of uppercase and lowercase English letters with the property that for every positive integer n, the nth characters in x and y are the same letter, either uppercase or lowercase. Show that R is an equivalence relation.
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