Set of subsets

Let X = { 1 ; 2 ; 3 ; 4 ; 5 ; 6 ; 7 } X=\{1;2;3;4;5;6;7\} , and let A = { F 1 ; F 2 ; ; F n } A=\{F_1;F_2;\ldots;F_n\} be a collection of distinct subsets of X X such that the intersection F i F j F_i\cap F_j contains exactly one element whenever i j i\ne j . For each i X i\in X ,let r i r_i be the number of elements in A A which contains i i .

Suppose r 1 = r 2 = 1 ; r 3 = r 4 = r 5 = r 6 = 2 r_1=r_2=1; r_3=r_4=r_5=r_6=2 and r 7 = 4 r_7=4 .

Find the value of n 2 n n^2-n .


This is a part of the Set .


The answer is 20.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

The number of combinations formed by pairing the elements in A= n ( n 1 ) 2 \frac{n(n-1)}{2} On the other hand, since each of the numbers 3, 4, 5, 6 are present in two sets only, and any pair of elements in A only have 1 common element, the number of distinct pairs of elements in A with common elements being 3, 4, 5 or 6=1 4=4 Concerning the number 7, the number of distinct pairs of elements in A with common elements being 7=4 3/2=6 Concerning the numbers 1 and 2, as each of them is present in one element of A only, they can't be the common element of any pair. Therefore, n*(n-1)/2=4+6 Solving, n=5 or -4 (rejected) So, n^(2)-n=20

Can you please elaborate

Tarun B - 4 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...