Let , and let be a collection of distinct subsets of such that the intersection contains exactly one element whenever . For each ,let be the number of elements in which contains .
Suppose and .
Find the value of .
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.
The number of combinations formed by pairing the elements in A= 2 n ( n − 1 ) 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