Let R be a relation on the set N of natural numbers defined by nRm Û n is a factor of m (i.e., n|m). Then R is

Let R = , where N is the set of all natural numbers. Then the relation R is :

Let R be a relation on the integers, where R=

Let A={1,2,3,4} and R={(1,2),(2,3),(1,4)} be a relation on A. Let S be the equivalence relation on A such that R⊂S and the number of elements in S is n. Then, the minimum value of n is_______.

Consider a relation R=(M, N, O, P, Q) with the dependencies: {M,N ->O; O,P->Q ; P, Q-> N}. The key for relation R is :a.M, N, Ob.M, N, Pc.N, O, Pd.M, N

Let R1 be a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} and R2 be another relation from B to C = {1, 2, 3, 4} as defined below:An element a in A is related to an element b in B (under R1) if a××b is divisible by 3.An element a in B is related to an element b in C (under R2) if a××b is even but not divisible by 3.Which is the composite relation R1R2 from A to C?Question 2AnswerR1R2 = {(2,2), (3, 2), (3, 4), (5, 1), (5, 3), (7, 1)}R1R2 = {(1, 2), (1, 4), (3, 3), (5, 4), (5,6), (7, 3)}ΦR1R2 = {(1, 2), (1,6), (3, 2), (3, 4), (5, 4), (7, 2)}