retagged by
438 views
5 votes
5 votes

Let $\text{N}$ be the set of positive integers. Consider the relation $\text{R}$ on $\text{N}$ defined by $x\text{R}y$ if and only if $\gcd(x,y)>1.$

The relation $\text{R}$ on $\text{N}$ is ________

  1. Reflexive
  2. Symmetric
  3. Transitive
  4. Equivalence relation
retagged by

1 Answer

8 votes
8 votes
Not transitive because $4\text{R}6$ and $6\text{R}9$ But $4$ is not related to $9.$

$\text{R}$ is not reflexive since $\gcd(1,1)=1$ and $1\text{R}1$ is false.

$\text{R}$ is symmetric since if $x\text{R}y$ then $\gcd(x,y)>1$ and $\gcd(y,x) = \gcd(x,y)>1$ and therefore $y\text{R}x.$

$\text{R}$ is not transitive: $2\text{R}6$ and $6\text{R}3$ are both true but $2\text{R}3$ is false.
Answer:

Related questions

623
views
1 answers
3 votes
GO Classes asked Apr 21, 2022
623 views
We define a relation $\text{S}$ on a non-empty Set $\text{A}.$ The definition of relation $\text{S}$ ... no infinite set $\text{A}$ on which such relation $\text{S}$ can be defined.
476
views
1 answers
7 votes
GO Classes asked Apr 21, 2022
476 views
Let $\text{Z}$ be the set of all integers. Define a relation $\text{S}$ on $\text{Z} \times \text{Z}$ by $(w,x)\text{S}(y,z)$ ... disjoint from the equivalence class of $(a-2,b+2),$ for all $a,b,c,d \in \text{Z}.$
552
views
3 answers
4 votes
GO Classes asked Apr 21, 2022
552 views
Let $\text{A}$ be any set.The following are the definitions of Irreflexive and Asymmetric Relations :A binary relation $\text{R}$ ... is antisymmetric.Every relation which is both Irreflexive and Asymmetric is in strict order.
788
views
1 answers
4 votes
GO Classes asked Apr 21, 2022
788 views
A relation $\text{R}$ on a set $\text{A}$ is said to be triangular iff $a\text{R}b$ and $c\text{R}b$ together imply $a\text{R}c,$ ... If a relation $\text{S}$ is transitive and triangular, then $\text{S}$ is a symmetric relation.