Define an equivalence relation R on the positive integers A = {2, 3, 4, . . . , 20} by m R n if the largest prime divisor of m is the same as the largest prime divisor of n. The number of equivalence classes of R is

Related MCQs

• If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.
• The union of two equivalence relations on a non- empty set is an equivalence relation.
• A relation R is defined on Z by xRy if 2x +5y = 0(mod7). Then the equivalence class[10] is equal to the equivalence class…
• Let S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21}. What is the smallest integer N > 0 such that for any set of N integers, chosen from S, there must be two distinct integers that divide each other? IZ
• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
• Consider the divides relation, m | n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The cardinality of the covering relation for this partial order relation (i.e., the number of edges in the Hasse diagram) is
• Define f(n) = n/2 + 1−(−1)n/4 for all n 2 Z. Thus, f: Z → Z, Z the set of all integers.Which is correct?
• Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2, 3}. The directed graph (including loops) of the transitive closure of this relation has
• Let N+ denote the nonzero natural numbers. Define a binary relation R on N+ × N+ by (m, n)R(s, t) if gcd(m, n) = gcd(s, t). The binary relation R is
• Sum of first n positive integers is