Let S be the set of all strings of 0's, 1's, and 2's that have length 4 and for which the sum of the characters in the string is less than or equal to 2. Define a relation R on S as follows: Vs,te S, s Rt the sum of the characters of strings equals the sum of the characters of string t. 1. How many distinct elements are in set S? 2. How many distinct equivalence classes exist for relation R? Answer with an integer. Answer with an integer.

Let S be the set of all strings of 0's, 1's, and 2's that have length 4 and for which the sum of the characters in the string is less than or equal to 2. Define a relation R on S as follows: Vs,te S, s Rt the sum of the characters of strings equals the sum of the characters of string t. 1. How many distinct elements are in set S? 2. How many distinct equivalence classes exist for relation R? Answer with an integer. Answer with an integer.

Elements Of Modern Algebra

8th Edition

ISBN:9781285463230

Author:Gilbert, Linda, Jimmie

Publisher:Gilbert, Linda, Jimmie

Chapter1: Fundamentals

Section1.7: Relations

Problem 11E: Let be a relation defined on the set of all integers by if and only if sum of and is odd. Decide...

See similar textbooks