Question: Definition: Let R be a relation on the set A. The powers R n n = 1, 2, 3, ... are defined recursively by R1

 Definition: Let R be a relation on the set A. The

Definition: Let R be a relation on the set A. The powers R n n = 1, 2, 3, ... are defined recursively by R1 = R and R n + 1 = R n compositefunction R. The definition shows that R2 = R compositefunction R, R3 = R2 compositefunction R = (R compositefunction R) compositefunction R and so on. Let R = {(1, 1), (2, 1), (3, 2), (4, 3)}. Use the definition above to find R n n = 2, 3, 4

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!