10
Aug 2015

# Note on Counting: Exercise 13.17 answer

Tags |

On Computer Technology

This is a short note detailing some of my thoughts to the answer to Exercise 13.17 in the book Counting, by Prof Koh Khee Meng and Prof Tan Eng Guan. (**NOTE:** Despite the lone one star review on Amazon for the first edition of the book, this is imho a pretty good book. I'll do a review of it soon.)

Question:

Six scientists are working on a secret project. They wish to lock up the documents in a cabinet so that the cabinet can be opened when and only when three or more of the scientists are present. What is the smallest number of locks needed? What is the smallest number of keys each scientist must carry?

I must admit that I totally went wtf when I saw this question. First thought in my mind was: Wtf is this? Second thought was: what does this have got anything to do with combinatorics? Then I attacked the problem for a while and couldn't solve it. In my opinion, this is one of the toughest problems in the whole book.

So after I completed most of the exercises for Chapter 13, which is the final chapter, I read through the Solutions Manual. And what I saw surprised me. Here's the core part of the solution:

Since the cabinet can be opened only when three or more of the scientists are present, no group of 2 scientists can open all the locks, i.e. each group of 2 scientists cannot open at least one lock. Suppose the group consisting of scientists \(A\) and \(B\) cannot open a particular lock \(L\). Then, each of the other 4 scientists must be able to open lock \(L\); otherwise the combined group of 3 scientists (\(A, B\) and any one of the other 4) will not be able to unlock the cabinet, a contradiction. Thus, each group of 2 scientists cannot open at least one lock unique to their group. There are \( { 6 \choose 2 } = 15 \) groups of two scientists, each of which cannot open at least one lock unique to their group. Hence, there are at least 15 locks.

Let \(X\) be one of the scientists. There are \( { 5 \choose 2 } = 10 \) groups of two scientists which do not include \(X\), each of which cannot open one distinct lock. Since every group of 3 scientists can open all the locks, \(X\) must have the keys to each of these distinct 10 locks. Thus, each scientist must carry at least 10 keys.

The part which confused me was in the first paragraph, namely:

Thus, each group of 2 scientists cannot open at least one lock

uniqueto their group.

Like, why must every group of 2 scientists have at least one lock that they and only they can't unlock but any other group of 2 scientists can unlock? Why can't some of the locks be not unlockable by 2 or more distinct pairs of scientists? (My language my be a bit confusing, "not unlockable" means the lock cannot be unlocked)

After several wrong paths, I finally proved this by contradiction. Or so I thought. Until I wrote the section below and had to rethink my proof to make it a lot more robust.

Suppose for the sake of contradiction that some locks cannot be unlocked by 2 or more distinct pairs of scientists. Without loss of generality, we focus on one such lock and denote it as \(L_a\) and suppose that the pair of scientists \(S_1, S_2\) and the pair of scientists \(S_3, S_4\) cannot unlock lock \(L_a\).

Consider any group of 3 scientists from \(S_1, S_2, S_3, S_4\). They are unable to unlock \(L_a\). This is a contradiction, since any group of 3 scientists must be able to unlock all the locks. Therefore, our assumption must be false and there are no locks that cannot be unlocked by 2 or more distinct pairs of scientists.

In other words, every lock can either be unlocked by all pairs of scientists, or is not unlockable by one pair of scientists.

By the combination of these 2 facts:

- Every pair of scientists cannot unlock at least one lock
- Every lock can either be unlocked by all pairs of scientists, or is not unlockable by one pair of scientists

It follows that every pair of scientists cannot unlock at least one lock, and for every lock the pair cannot unlock, that particular lock is only not unlockable by that pair. This is equivalent to saying that every pair of scientists cannot unlock at least one lock unique to their group, which was what we were trying to prove. The rest of this part of the proof follows. (Since there are \({ 6 \choose 2 } = 15\) pairs of scientists, each of which cannot open at least one lock distinct to their group, there are at least 15 locks.)

My initial proof only proved that it is impossible for any lock to be not unlockable by 2 or more distinct pairs of scientists. I realized that that alone is not sufficient to prove that every pair of scientists cannot unlock at least one lock unique to their group. I wrote a much longer proof but realized after a while that I was confusing 1. what I was trying to prove 2. the fact that I will be proving as the result of a contradiction 3. the concept of all vs. some. The English I was using probably helped a lot in confusing me. It was only until the end that I think I got it. Writing this post definitely helped to organize my thoughts.

More posts coming up soon.

Disclaimer: Opinions expressed on this blog are solely my own and do not express the views or opinions of my employer(s), past or present.