So
and
both has to be even or odd simultaneously and
can't be odd so
and
both will be even
For symmetric we need to add 6 elements as
For
and
has to be equal
is always even so
will also be even
For symmetric we need to add 4 element as
So
and
both has to be even or odd simultaneously and
can't be odd so
and
both will be even
For symmetric we need to add 6 elements as
For
and
has to be equal
is always even so
will also be even
For symmetric we need to add 4 element as
and is even reflexive even symmetric of is even, then is also even transitive of is even is even then is also even So, relation is an equivalence relation.
From Diagram
For reflexive : is an irrational number is reflexive For symmetric : Let is an irrational number is an irrational number For example, Let is irrational but is not. is not symmetric For transitive : Let is irrational and is irrational. is irrational.
For example, take is not transitive.
For to be reflexive, must be in .
The means and must be true for all .
But always Therefore, is not reflexive If , then and
is symmetric If and , then , Since, and , then is not necessarily equal to .
Therefore, is not transitive.
The relation is symmetric but not reflexive or transitive.
Case 1 : x 4 (x 3)(x 4) = 6 (x + 3)(x + 4) = 6 x2 + 7x + 6 = 0 x = 1 or 6 but x 4 x = 6 Case 2 : x
(4, 0) (x 3)(x + 4) = 6 x2 7x 12 6 = 0 x2 + 7x + 18 = 0 D < 0 No solution Case 3 : x 0 (x 3)(x + 4) = 6 x2 + x 12 6 = 0 x2 + x 18 = 0 x =
x =
only
But other such that
5 other pairs needs to be added to be symmetric needs to be added,
Given
and
As
for any
is not reflexive. Hence
in not an equivalence relation. Also
is an integer
as
is an integer
is reflexive. If
is an integer then
is also an integer
is symmetric If
is an integer and
is an integer then
is also an integer.
is transitive Hence
is an equivalence relation
Given sets : We want to find the number of elements of the form such that : divides divides For the first condition : divides Given and , we can list the pairs: This gives 6 pairs.
For the second condition, the pairs are the same, because it's just the reversed relation.
So : divides Again has 6 valid pairs.
Now, for every pair from the first condition, we can have any pair from the second condition.
This leads to : relations.
For relation Then, on relation is symmetric If then not necessarily positive is not symmetric