How to find ordered pairs in smallest transitive relation?

40 Views Asked by At

Let R={(1,2),(2,3),(3,4),(2,1)} . How many ordered pairs belong to the smallest transitive relation Rt that contains R?

1

There are 1 best solutions below

0
On

Welcome to MSE! You must transitively close the relation. Here:

$(1,2),(2,3)\in R$ require to add $(1,3)$.

$(2,3),(3,4)\in R$ require to add $(2,4)$.

$(1,2),(2,1)\in R$ require to add $(1,1),(2,2)$.