## Monday, June 25, 2007

### Lion's Hunger

Problem

------------

In a zoo far far away ( I am being a little dramatic, eh? :D ), there was a cage filled with n lions. One day the care taker of the zoo put in only one huge meat loaf in the cage. If any lion eats the meat, he will feel dizzy and will fall asleep. Now, that the lion has fallen asleep, he would serve as meat for other lions. Also, assume hypothetically that all lions are intelligent, so none of them would want to get killed.

If you are one of the lion and given an option to eat the meat, would you go for it??

Solution

-----------

Like many of the interesting problem in mathematics, this can be solved using the principle of mathematical induction.

If you are the only lion in the cage, you can go ahead and have your food.

If two lions are there, none of them would eat. why?? Because, if any one of them eat the meat then he is going to be killed by the other lion.

What if three lions are there? you know that if you eat the meat, you will fall asleep. Though you will be as good as meat for other two lions during your slumber, none of them would eat you for the reason stated above.

It is easy to generalize and see that you can have your meal if odd number of lions (including yourself ) are in the cage. For the case of even number of lions, it is better to stay hungry :p.

## Wednesday, June 20, 2007

### આવ મારા આંસુની ચમક આપું તને ..

Found this nice poem in the "about me" section of rushi's Orkut profile.

------------------------------

આવ મારા આંસુની ચમક આપું તને ..

તું મને જોઇને બહુ ઝાંખી રીતે મલકાય છે .. ..

•.¸¸.•♥´¨`♥•.¸

મદમસ્ત એવી ચાલ ચાલ ના ,

કેટલાય મુસાફરોની મંઝીલ બની જઇશ ..

સંભાળીને રાખ તારા કાજળભર્યા નયન ,

બેફામ વરસ ના , કાતીલ બની જઇશ ..

આ રીતે ઝુલ્ફોને હાથોથી પસવાર ના ,

કેટલાયે શાયરોની ગઝલ બની જઇશ ..

આટલું ધ્યાન દઇને ગઝલ વાંચ ના ,

કોઇના પ્રેમમાં પાગલ બની જઇશ .. ..

█▓▒░

તું નથી આ સુરના શણગારમાં ..

તું નથી આ શબ્દના આકારમાં ..

ક્યા નજાકત તારી ને , ક્યા આ જગત ..

સાચવું તેથી જ તને ધબકારમાં .. ..

•.¸¸.•♥´¨`♥•.¸

ટોળે વળે છે કોઇની દીવાનગી ઉપર ..

દુનીયાના લોકો કેવા મીલનસાર હોય છે .. ..

█▓▒░

વાત મારી નીકળી તો હશે ..

સાંભળી પાંપણો ઢળી તો હશે ..

મૌન પાળ્યું હશે છતાં "ઘાયલ" ..

આહ આંખોમાં સળવળી તો હશે .. ..

## Tuesday, June 19, 2007

### Honour among thieves???

Seems I have been too frequent in posting on my blog now a days. Thanks to my friends Sanjeet, Pranjal, Ashok ... with whom I discuss interesting problems. Just like my previous post, this post is also regarding a technical interview question asked in some company. Anyways, coming directly to the point.

Problem

-----------

There are five thieves T1, T2, T3, T4 and T5. They robbed 100 gold bars from a bank. For dividing the gold bars they came up with following idea.

- Starting from T5 to T1, a thief T_i will come up with a scheme to divide the gold bars amongst the thieves.

- Voting will happen in favour or against this scheme. If Majority ( Strictly greater than 50 % ) votes in favour then the division will happen according to the scheme. If not, then T_i will be killed and it will be T_i-1's turn to come up with a scheme.

Please keep in mind that

1) All thieves are intelligent.

2) All are very greedy, so they would try to get as much wealth as possible.

3) They all would like to kill as many thieves as possible. Of course, this motive stands at a lower priority level as compared to their greed for the gold.

If you are T5, what scheme would you come up with? Obviously, your motive would be to survive but try to come up with a scheme where you will get away with as much gold as possible.

PS:- Smallest unit of division is a gold bar. A bar can not be further divided.

-----

Solution

----

The answer is that if you are T5, you can get away with as much as 97 gold bars and still survive!!! Puzzled!! Read further to discover how.

Let's try to situation one by one from thieves perspective.

If T1 is the only person left, he will take all the gold bars.

If T1 and T2 are the only persons alive, no matter what scheme T2 comes up with, he is going to be killed and T1 would take everything. Because T2 can not get the majority ( > 50% ). Obviously, T2 would do anything to keep T3 alive.

T3 knows that T2 is going to support him no matter what scheme he comes up with. T3 can take away all 100 gold bars as he will have the majority no matter what. ( T3+T2 = 66% votes ). Obviously, T3 would like T4 to get killed so that he can take everything.

T4 knows that T3 would want him to be killed. If T4 is killed, T1 and T2 would not get anything. So T4 would give one gold bar to T1 and T2 each. Now, T4 will get the majority ( T1 + T2 + T4 = 75%) and he can take as much as 98 gold bars.

You are T5. If you get killed, you know that T3 would not get anything. So to take T3 into confidence you will give him a gold bar. If you get killed, T1 and T2 each get a gold bar. As you want to optimize the amount that you can get away with, you would give one of T1 or T2 2-gold bars. You can get away with as much as 97 gold bars!!!

## Monday, June 18, 2007

### Young Tableau

The other day me, sanjeet, and pranjal were discussing a few questions ( or puzzles ) which are likely to be asked in technical interviews. One of the question that was asked to someone in google was about finding out a specific element in an n x n Young Tableau.

Let me first define, what a young tableau is. It is an m x n array with the following property.

for all j = 1 to n-1, A[p][i] <= A[p][i+1]

and for all , i = 1 to m-1 , A[i][q] <= A[i+1][q] It is easy to see that following statement holds for a young tableau.

- For any sub-matrix of a young tableau, the top-left element is the smallest element within that sub-matrix.
- For any sub-matrix of a young tableau, the bottom-right element is the largest element within that sub-matrix.

----

Method -1

----

Start with the top-right element of the tableau. Compare this element e with the element to be found x.

if e > x then

discard the column in which e appears. ( Because e is the first(smallest ) element of that column.

else

discard the row in which e appears.

end if.

Repeat this exercise until the element is found or the tableau is exhausted.

It is easy to see that time complexity of Method-1 is O(n). As at every step we will discard either row or column which will take at most 2n steps.

---------

Method - 2

---------

Do a binary search over the diagonal of the tableau. If we find the desired element x then we are done. If not, we will have two element u and v where u <> u is the bottom-right element and v is the top-left element. The elements that we will discard at each step would be at least half of the elements in the original matrix.

Here is why,

i^2 + (n-i)^2 function is minimum where i=n/2. With i=n/2 the value of the function is (n^2)/2.

Now, if we do the analysis with respect to number of elements.

T(n^2) = 2T((n^2)/4) + logn

or

T(m) = 2T(m/4) + 0.5 logm

Solution of this recurrence, turns out to be O(m^(0.5)) = O(n). So, there is no improvement over the complexity as compared to the first method. Besides, this second method fails when the sub-matrices that were discarded were not square. In which case, the remaining two sub-matrices will not be square either.

----

Method 3

------

Compare the central element e with the desired element x.

if e > x then discard the bottom-right quadrant of the tableau.

else discard the top-left quadrant of the tableau.

Now , we are left with three sub-matrices of the size n/2 x n/2.

The recurrence would be

T(n) = 3T(n/2) + O(1).

Solving it would give us n^(log_2 3) = n^1.585. It turns out that even though in Method-1 you discard n elements and in this method you discard (n^2)/4, the complexity does not favour Method-3. Anyways, it was a good exercise to do this analysis.

## Thursday, June 14, 2007

### Necklace puzzle - yet another solution

Hi all,

I am posting here another solution to "Necklace Puzzle". The solution is by my friend Vaibhav Gupta

-------

Let A and B are the 2 necklaces with N gemstones. A and B has three types of

gemstones which are equal in number.

A = A[1] A[2] ... A[N]

B = B[1] B[2] ... B[N]

Where A[i] is the ith gemstone in Necklace A.

B[i] is the ith gemstone in Necklace B.

Let Color(A[i]) represents the type of the gemstone A[i].

We construct a bipartite graph G = (X,Y,E), with the following condition:

For each gemstone A[j] in A we create a node X_j in X. So |X| = N

Foe each gemstone B[j] in B we create a node Y_j in Y. So |Y| = N

E is the edges set from node in X to node in Y.

E = { (u,v) | u \in X and v \in Y and Color(u) = Color(v)}

|E| = (N^2) / 3 since each node has exactly N/3 edges.

We define weight to each edge in E:

Weight(e) = orientation of the string.

OR Mathematically

Weight((X_i,Y_j)) = i - j if i>=j

= N+i-j otherwise

0 <= Weight((X_i,Y_j)) <= N-1 since 1<=i<=N, 1<=j<=N So there are N possible values of weight.

Now we just need to prove that there are atleast N/3 edges of same weight.

This can be proved by pigon hole principle. There are (N^2) / 3 edges and

each edge has N possible values of weight so there must exist a set of

ceil(|E|/N) edges of same weight

|E| / N >= N/3

Hence proved.

For general case :

For 3 gemstone types

( a^2 + b^2 + c^2 ) / (a + b + c)

Where a is the number of gemstone of type 1.

b is the number of gemstone of type 2.

c is the number of gemstone of type 3.

For m gemstone types:

(N_1^2 + N_2^2 + N_3^2 ... + N_m^2) / (N_1+N_2+N_3 ..+N_m)

where N_i is the number of gemstone of type i.

---------

## Wednesday, June 13, 2007

### Quote by John Von Neumann

-- John Von Neumann

I saw this quote as saket's status message in google talk.

### Necklace Theorem - Solutions to puzzles

So I am back again after some gap. This post will describe the solutions to the two puzzle that I posed as part of my prequel post "Necklace Theorem". For the sake of clarity I am copying the puzzles again over here.

1) Given a point set of size n in 2D, prove that there would exist a pair of orthogonal lines which would divide the point set in such a way that in each quadrant number of points are at most n/4.

As shown in the figure on the left, let us consider a baseline B. The circle represent the point set we are interested in. Refer to the prequel of this post and convince yourself that it is possible to have a line in any given direction which divides the point set into two equal half. Hence, it is also possible to have two orthogonal lines both of which will divide the point set into two equal half. ( When I say, two equal half, I mean that division in two portion satisfying the constraint "less or equals n/2" ). As both p and q divides the point set into two equal half, the region which is captured on top-left and bottom-right will be equal ( call it x, or to be more precise "less or equal x" ). Similarly, tom-right and bottom-left would be equal ( call it y). Let us have a function f(x,y) = (x-y) = v. By rotating p and q , 90 degrees we will have function value exactly negative, as x and y would swap their places. From intermediate value theorem we can argue that there will be a configuration where x = y = n/4.

2) Given a point set of size n in 2D, prove that there would exist 3 concurrent lines which would divide the point set in such a way that in each segment the number of points are at most n/6.

With respect to the baseline B, we can have two lines p and q, each dividing the point set into equal half and region trapped as shown in figure would be equal to n/6 on each side. ( n/6 is written outside the circle to make it readable ). Now, as shown in the prequel post, we can have a line r which will divide the two point sets ( each of size n/3 ) into two equal half. This line r need not be concurrent with p and q. Let the triangle trapped between these three lines is equal to A. As we rotate this configuration 180 degree the area will become -A. Again, from intermediate value theorem we can state that area will be 0 at some configuration making r concurrent to p and q. Thus, each segment will have size n/6.