A group of friends is designing a messaging application

MATHEMATICS · Multi-part · CBSE · Mathematics · Relations and Functions · Relations and Functions

Problem

A group of 44 friends is designing a messaging application. Define a relation RR on the set of these friends such that (x,y)∈R(x,y)\in R if and only if xx can send a direct message to yy through the app. (a) If the app must allow messages to be sent only in pairs of friends who mutually agree (that is, whenever xx can message yy, yy can message xx), but sending a message to oneself is optional, identify the property satisfied by RR and the property it need not satisfy. (b) Under the rules stated in (i), determine the total number of possible relations RR on the set of 44 friends. (c) Suppose the designers further decide that no one should be able to message himself or herself. Keeping mutual messaging compulsory, calculate the number of possible relations under this new rule.

Related theory

Browse the problem library