The relation R on a set A= {1,2,3,4} is defined as {(1,1), (1,3), (2,2), (2,3), (3,1),(3,2) }. Then R is
Reflexive
Symmetric
Anti -symmetric
Transitive
The void relation on a set A is
Reflexvie and symmetric
Reflexive and transitive
Transitive and symmetric
A function is said to be bijective if its
One-one
Onto
Both (1) & (2)
None of these
If m elements are in a set A and n elements are in set B, then number of elements in set AxB is
m
n
mn
less than mn
The relation R defined on Set
{(-2,2), (-1,1), (0,0), (1,1), (2,2) }
{(-2,-2), (-2,2), (-1,1), (-1,-1), (0,0), (1,-2), (1,2), (2,-1), (2,-2)}
{(0,0), (1,2), (2,2)}
If R be a relation on NxN defined by (a,b) R (c,d) iff ad= bc; then R is
An equivalence relation
Symmetric and transitive but not reflexive
Reflexive and transitive but not symmetric
Reflexive and symmetric but not trasitive.
If AxB= {(1,1), (1,2), (1,3),(2,1),(2,2),(2,3)}, then A is equal to
{1,2}
{1,2,3}
{2,3}
For real numbers x and y, are wirte x R y . x2-y2+√3 is irrational number. Then the relation R is
Let A = {2,3,4,5} and R= {(2,2), (3,3), (4,4) (5,5) } be a relation in A the R is
Trasitive
Two finite sets A and B having m and n elements. The total number of relation A to B is 64, then possible values of m and n are.
2 and 4
2 and 3
2 and 1
64 and 1
