Question

3. (a) If aRb is a relation of congruent modulo n, a ≡ b (mod n). Show that R is:

(i) reflexive.

(ii) symmetric.

(iii) transitive.

(b) A is a set and | A | = 8. R is a relation on A, R ⊆ A X A.

(i) How many different R can be produced?

(ii) How many R are reflexive?

(iii) How many R are symmetric?

(iv) How many R are reflexive and symmetric?

(c) A computer application consists of 9 modules. The given table shows the relation on the modules with time required to pro

0 0
Add a comment Improve this question Transcribed image text
Answer #1

a) aRb asb (mod n) Reflurive: Notice that azalmod n) becaue n la-a o aRa >> R is pefleti ve Suppore a b(modn) ne n aRb na-b =

Add a comment
Know the answer?
Add Answer to:
3. (a) If aRb is a relation of congruent modulo n, a ≡ b (mod n)....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT