A company specializing in international trade has 70 employees. For any two employees A and B, there is a language that A speaks but B does not, and also a language that B speaks but A does not. At least how many different languages are spoken by the employees of this company?
I think the answer is 70 (the case where each person speaks only one language - that nobody else speaks). Am I right?
70 is a possible answer but not the least possible. 70 would be the minimum possible answer if one employee speaks only one language.Originally Posted by alexmahone
EDIT: for example suppose the company only had 3 employees A,B and C. Then only 2 languages
k and m would suffice. A speaks k and m both. B speaks only k and C speaks only n.
Now afgter some thought i think 7 languages will suffice. Letis a seven element subset where each element of
proper subsets of a 7 element set. Choose any 70 subsets of
The answer is 8.
The requirement on A and B is equivalent to the statement that the sets of A's and B's languages are non-empty and neither is a subset of the other. Let there be 8 languages and assign each subset of size 4 to an employee. There are C(8,4) = 70 such subsets, and no subset of size 4 can be a subset of another subset of size 4.
That at least 8 languages are required is a consequence of Sperner's Theorem:
Ifare subsets of
such that
is not a subset of
if
, then
.
It can't be 8. Any repetition of a language at any point would allow you to find two employees A and B that both speak a common language. At least 70 must be spoken.
Has the world gone mad or am I misunderstanding the question?
suppose A speaks greek and latin and B speaks Latin and English. Then there exists a language (greek) which A speaks but B does not and there exists a language (English) which B speaks but A does not. Although there is a language(latin) which is shared by A and B still this doesn't violate the conditions of the question.
Ah, ok. That makes more sense. I read it as A can't know a language that B knows etc.thanks. Although that is 3 languages for 2 people :S
Your other example doesn't make sense though as B doesn't speak a language that A does not (and neither does C assuming m=n).
So, an example of n people speaking less than n languages while satisfying the question would be:
A(1,2), B(2,3), C(3,4), D(4,1), E(4,2), F(1,3)
It seems you can't do it for less than 4 languages.
yes i had realized my mistake. thanks anyway!!Ah, ok. That makes more sense. I read it as A can't know a language that B knows etc.
Your other example doesn't make sense though as B doesn't speak a language that A does not (and neither does C assuming m=n).
So, an example of n people speaking less than n languages while satisfying the question would be:
A(1,2), B(2,3), C(3,4), D(4,1), E(4,2), F(1,3)
It seems you can't do it for less than 4 languages.
  |
LinkBack URL
About LinkBacks