This problem requires calculating the overlap in attendance between meetings, given specific attendance numbers and the constraint that each professor attended exactly two meetings.
Let the number of professors attending:
We are given the total attendance for each city:
Since each professor attended exactly two meetings, the total attendance for each city can be expressed as the sum of professors attending the pairs including that city:
We need to find the number of professors who attended both Chennai and Delhi meetings, which is DC.
We have a system of three linear equations:
Add all three equations together:
$(MD + MC) + (MD + DC) + (MC + DC) = 21 + 27 + 30$
Simplify the left side:
$2 \times MD + 2 \times MC + 2 \times DC = 78$
Factor out the 2:
$2 \times (MD + MC + DC) = 78$
Divide by 2 to find the total number of professors (sum of all pairs):
$MD + MC + DC = \frac{78}{2} = 39$
To find DC, substitute the value of $MD + MC$ from equation (1) into the total sum:
$21 + DC = 39$
Solve for DC:
$DC = 39 - 21$
$DC = 18$
Thus, 18 professors attended both the Chennai and Delhi meetings.
Match List-I with List-II
| List-1 | List-II |
| (A) If X and Y are two sets such that n(X)= 17, n(Y)=23, n(X $\cup$ Y)=38, then n(X $\cap$ Y) is | (I) 20 |
| (B)) If n(X) = 28,n(Y) = 32,n(X$\cap$Y) = 10, then n(X$\cup$Y) is | (II) 10 |
| (C) If n(X) = 10, then n(7X) is | (III) 50 |
| (D) If n(Y) = 20, then n($\frac{Y}{2}$) is | (IV) 2 |
Choose the Correct answer from the options given below:
Consider the following relation R={(4,5),(5,4), (7,6),(6,7)} on set I={4,5,6,7}. Which of the following properties relation R does not have?
A. Reflexive property
B. Symmetric property
C. Transitive property
D. Antisymmetric property
Choose the correct answer from the options given below:
Find the least upper bound and greatest lower bound of $S=\{X,Y,Z\}$ if they exist, of the poset whose Hasse diagram is shown below: