Relations and F...

Let A = {1, 2, 3} and B = {5, 6, 7, 8, 9} and let f(x) = {(1, 8), (2, 7), (3, 6)} then f is

The law a + b = b + a is called

For  which one of these mappings the function  f(x) = x ² will be one-one?

Let A = {1,2,3,4,5,6,7}. P={1,2}, Q = {3, 7}. Write the elements of the set R so that P, Q and R form a partition that results in equivalence relation.

A function f: A→B is said to be invertible, if there exists a function g: B→A such that

Let R be the relation on the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3,3), (3,2)}. then R is

If A = N x N and * be any binary operation on A defined by

(a, b) * (c, d) = (a + c, b + d), then the binary operation is