Sets, Relations...

Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is

Given the relation R = {(1, 2), (2, 3)} on eht set {1, 2, 3}, the minimum number of ordered pairs which when added to R make it an equivalence

Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relations on the set A = {1, 2, 3, 4}. the relation R is

The relation R in the set Z of integers given by R = {(a, b): 2 divides a –b}(a, b) where a, b ∈Z is

The range of the function f(x) = x –[x] is

Let A contain n distinct numbers. How many bijections from A to A can be defined?

Number of relations that can be defined on the set A = {a, b, c, d} is

A relation R in a set A is called universal relation, if

Let R be the relation defined in the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and b are either odd or even}. Then R is

If f(x) = x –x² , then f(a + 1) –f(a –1) , a  ∈ R is :