<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Puzzle : Kissa Kursi Ka ( A matter of a seat )</title>
	<atom:link href="http://sbjoshi.wordpress.com/2008/05/28/puzzle-kissa-kursi-ka-a-matter-of-a-seat/feed/" rel="self" type="application/rss+xml" />
	<link>http://sbjoshi.wordpress.com/2008/05/28/puzzle-kissa-kursi-ka-a-matter-of-a-seat/</link>
	<description>Saurabh Joshi's Blog about math, algorithms, theorems, puzzles ....</description>
	<lastBuildDate>Mon, 02 Nov 2009 15:22:02 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Saurabh Joshi</title>
		<link>http://sbjoshi.wordpress.com/2008/05/28/puzzle-kissa-kursi-ka-a-matter-of-a-seat/#comment-125</link>
		<dc:creator>Saurabh Joshi</dc:creator>
		<pubDate>Wed, 08 Oct 2008 05:51:43 +0000</pubDate>
		<guid isPermaLink="false">http://sbjoshi.wordpress.com/?p=23#comment-125</guid>
		<description>@amit,
              if you read carefully vikas&#039; argument is write. It&#039;s upto you to buy the argument or not, but if not then you should produce a counter-example which you did not.</description>
		<content:encoded><![CDATA[<p>@amit,<br />
              if you read carefully vikas&#8217; argument is write. It&#8217;s upto you to buy the argument or not, but if not then you should produce a counter-example which you did not.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Amit Chandel</title>
		<link>http://sbjoshi.wordpress.com/2008/05/28/puzzle-kissa-kursi-ka-a-matter-of-a-seat/#comment-124</link>
		<dc:creator>Amit Chandel</dc:creator>
		<pubDate>Tue, 07 Oct 2008 14:31:05 +0000</pubDate>
		<guid isPermaLink="false">http://sbjoshi.wordpress.com/?p=23#comment-124</guid>
		<description>Let us denote seat numbered i as S_i, and person numbered j as P_j

@Vikas
if I consider 3 passangers only then it can happen that P_1 sits at S_2, and P_2 sit at S_3. So P_3 will neither see P_1 on his seat nor an empty seat. So I am sorry I cannot buy your argument.

I have also applied induction to arrive at 1/2 in this way:
Let f(n) denote the probability that the last person will see his seat empty given there are n passangers.
Base Case: n=2  f(2) = 1/2 . Obvious!
Now we have to prove that f(n) = 1/2 assuming f(m) = 1/2 for all 1 &lt; m &lt; n. Here we go.

P_n can see his seat empty in two cases:
Case #1: P_1 sits on S_1. Prob(Case #1) = 1/n
Case #2: P_1 sits neither on S_1 nor on S_n. He chooses S_k where 1 &lt; k &lt; n.
If he sits on S_k, when P_k comes, he will see S_1 empty, P_2 on S_2, P_3 on S_3, ...., and P_1 on S_k. Lets ignore seats from 2 to k and passangers P_1 to P_(k-1). So we removed k-1 seats and k-1 passangers. Lets re-number the seats and passangers reducing all by k, except S_1. We get the same problem with k passangers and k seats. 
So probability of last person getting his seat in this situation = (prob of case#2 happening) * (probability of last person getting his seat  given case#2 i.e. under modified problem )
     = ( P_1 neither sit on S_1 not on S_n) * f(k) where 1 &lt; k &lt; n
     = ( (n-2)/n ) * (1/2)  = (n-2)/(2n)


hence f(n) = 1/n + (n-2)/2n = 1/2.</description>
		<content:encoded><![CDATA[<p>Let us denote seat numbered i as S_i, and person numbered j as P_j</p>
<p>@Vikas<br />
if I consider 3 passangers only then it can happen that P_1 sits at S_2, and P_2 sit at S_3. So P_3 will neither see P_1 on his seat nor an empty seat. So I am sorry I cannot buy your argument.</p>
<p>I have also applied induction to arrive at 1/2 in this way:<br />
Let f(n) denote the probability that the last person will see his seat empty given there are n passangers.<br />
Base Case: n=2  f(2) = 1/2 . Obvious!<br />
Now we have to prove that f(n) = 1/2 assuming f(m) = 1/2 for all 1 &lt; m &lt; n. Here we go.</p>
<p>P_n can see his seat empty in two cases:<br />
Case #1: P_1 sits on S_1. Prob(Case #1) = 1/n<br />
Case #2: P_1 sits neither on S_1 nor on S_n. He chooses S_k where 1 &lt; k &lt; n.<br />
If he sits on S_k, when P_k comes, he will see S_1 empty, P_2 on S_2, P_3 on S_3, &#8230;., and P_1 on S_k. Lets ignore seats from 2 to k and passangers P_1 to P_(k-1). So we removed k-1 seats and k-1 passangers. Lets re-number the seats and passangers reducing all by k, except S_1. We get the same problem with k passangers and k seats.<br />
So probability of last person getting his seat in this situation = (prob of case#2 happening) * (probability of last person getting his seat  given case#2 i.e. under modified problem )<br />
     = ( P_1 neither sit on S_1 not on S_n) * f(k) where 1 &lt; k &lt; n<br />
     = ( (n-2)/n ) * (1/2)  = (n-2)/(2n)</p>
<p>hence f(n) = 1/n + (n-2)/2n = 1/2.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: vikas</title>
		<link>http://sbjoshi.wordpress.com/2008/05/28/puzzle-kissa-kursi-ka-a-matter-of-a-seat/#comment-72</link>
		<dc:creator>vikas</dc:creator>
		<pubDate>Tue, 03 Jun 2008 07:00:21 +0000</pubDate>
		<guid isPermaLink="false">http://sbjoshi.wordpress.com/?p=23#comment-72</guid>
		<description>A simpler proof would be if you observe that the last person will either find his seat empty or the seat assigned to passenger 1. Any other seat if empty till last would have already been taken by the person to whom it was assigned. 
So now among these two possibilities, any person before the last would have no preference for either of the two so the probability that any of them is vacant till the last has to be same which is 1/2</description>
		<content:encoded><![CDATA[<p>A simpler proof would be if you observe that the last person will either find his seat empty or the seat assigned to passenger 1. Any other seat if empty till last would have already been taken by the person to whom it was assigned.<br />
So now among these two possibilities, any person before the last would have no preference for either of the two so the probability that any of them is vacant till the last has to be same which is 1/2</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Increasing or decreasing subsequence &#171; Me, Myself and Mathematics</title>
		<link>http://sbjoshi.wordpress.com/2008/05/28/puzzle-kissa-kursi-ka-a-matter-of-a-seat/#comment-61</link>
		<dc:creator>Increasing or decreasing subsequence &#171; Me, Myself and Mathematics</dc:creator>
		<pubDate>Fri, 30 May 2008 09:41:33 +0000</pubDate>
		<guid isPermaLink="false">http://sbjoshi.wordpress.com/?p=23#comment-61</guid>
		<description>[...] found this problem here. Solution to the second puzzle given in that post is already posted in Kissa Kursi Ka. I tried a couple of approaches to solve the first one but could not succeed. Finally, Deepanjan [...]</description>
		<content:encoded><![CDATA[<p>[...] found this problem here. Solution to the second puzzle given in that post is already posted in Kissa Kursi Ka. I tried a couple of approaches to solve the first one but could not succeed. Finally, Deepanjan [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
