<?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: Making It Count: The Pigeonhole Principle</title>
	<atom:link href="http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/feed/" rel="self" type="application/rss+xml" />
	<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/</link>
	<description>...a godsend to the millions who look around on slow news days and wonder “Whats goin’ on..in mathematics these days?”</description>
	<lastBuildDate>Wed, 23 Jul 2008 01:21:16 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Making It Count: Counting the complement &#171; The Mumbling Mathematician</title>
		<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/#comment-31</link>
		<dc:creator>Making It Count: Counting the complement &#171; The Mumbling Mathematician</dc:creator>
		<pubDate>Wed, 23 Jul 2008 01:21:16 +0000</pubDate>
		<guid isPermaLink="false">http://zetahype.wordpress.com/?p=5#comment-31</guid>
		<description>[...] under: Uncategorized &#8212; zetahype @ 1:21 am   Here&#8217;s the much delayed second part of the Making It Count series which was launched with much fanfare a month ago. The counting technique I will present is [...]</description>
		<content:encoded><![CDATA[<p>[...] under: Uncategorized &#8212; zetahype @ 1:21 am   Here&#8217;s the much delayed second part of the Making It Count series which was launched with much fanfare a month ago. The counting technique I will present is [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: zetahype</title>
		<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/#comment-20</link>
		<dc:creator>zetahype</dc:creator>
		<pubDate>Tue, 24 Jun 2008 13:41:51 +0000</pubDate>
		<guid isPermaLink="false">http://zetahype.wordpress.com/?p=5#comment-20</guid>
		<description>umm..i did..the party of 6 problem is the one I solved in the second example.</description>
		<content:encoded><![CDATA[<p>umm..i did..the party of 6 problem is the one I solved in the second example.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Meech</title>
		<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/#comment-19</link>
		<dc:creator>Meech</dc:creator>
		<pubDate>Tue, 24 Jun 2008 13:39:18 +0000</pubDate>
		<guid isPermaLink="false">http://zetahype.wordpress.com/?p=5#comment-19</guid>
		<description>You were talking about Ramsey numbers but didnt introduce the Party Problem? That I would have thought would be the party piece.</description>
		<content:encoded><![CDATA[<p>You were talking about Ramsey numbers but didnt introduce the Party Problem? That I would have thought would be the party piece.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: zetahype</title>
		<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/#comment-14</link>
		<dc:creator>zetahype</dc:creator>
		<pubDate>Tue, 24 Jun 2008 08:03:02 +0000</pubDate>
		<guid isPermaLink="false">http://zetahype.wordpress.com/?p=5#comment-14</guid>
		<description>You are right. I have unintentionally used a generalised version of the pigeonhole principle in the second problem: If n objects are distributed among m boxes then at least one box will have [n/m] objects, where [*] is the smallest integer greater than or equal to *.
In the problem we want to distribute 5 edges between two colours, so at least one colour will have [5/2] = 3 edges.
Note that this version of the pigeonhole principle allows us to introduce probabilities. If an object has an even chance of being alloted one of the m boxes (uniform probability 1/m) we ask what the probability of one of the boxes having more than one object is. Ofcourse, if n&gt;m, the probability is 1 but it is not hard to compute the probability even otherwise. The &quot;probabilistic pigeonhole  principle&quot; is a useful tool in solving density problems in number theory. I am sure we will encounter it later.</description>
		<content:encoded><![CDATA[<p>You are right. I have unintentionally used a generalised version of the pigeonhole principle in the second problem: If n objects are distributed among m boxes then at least one box will have [n/m] objects, where [*] is the smallest integer greater than or equal to *.<br />
In the problem we want to distribute 5 edges between two colours, so at least one colour will have [5/2] = 3 edges.<br />
Note that this version of the pigeonhole principle allows us to introduce probabilities. If an object has an even chance of being alloted one of the m boxes (uniform probability 1/m) we ask what the probability of one of the boxes having more than one object is. Ofcourse, if n&gt;m, the probability is 1 but it is not hard to compute the probability even otherwise. The &#8220;probabilistic pigeonhole  principle&#8221; is a useful tool in solving density problems in number theory. I am sure we will encounter it later.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/#comment-12</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Mon, 23 Jun 2008 21:49:06 +0000</pubDate>
		<guid isPermaLink="false">http://zetahype.wordpress.com/?p=5#comment-12</guid>
		<description>I can under stand how you use the principle to the first problem but it is not obvious in the second one. It does not appear to a situation where one can use directly the pigeonhole principle that you stated?</description>
		<content:encoded><![CDATA[<p>I can under stand how you use the principle to the first problem but it is not obvious in the second one. It does not appear to a situation where one can use directly the pigeonhole principle that you stated?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: zetahype</title>
		<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/#comment-9</link>
		<dc:creator>zetahype</dc:creator>
		<pubDate>Mon, 23 Jun 2008 20:03:36 +0000</pubDate>
		<guid isPermaLink="false">http://zetahype.wordpress.com/?p=5#comment-9</guid>
		<description>Well..if you must know. I chose wordpress over blogspot because I heard it allows inline Latex commands which would help me type the maths bits. Turns out it supports latex at a very basic level..so I make pdf files using latex and capture them as images and attach them at the right places in my post. I&#039;m not terribly happy with the outcome but I&#039;m trying different things and will make improvements.</description>
		<content:encoded><![CDATA[<p>Well..if you must know. I chose wordpress over blogspot because I heard it allows inline Latex commands which would help me type the maths bits. Turns out it supports latex at a very basic level..so I make pdf files using latex and capture them as images and attach them at the right places in my post. I&#8217;m not terribly happy with the outcome but I&#8217;m trying different things and will make improvements.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tobias</title>
		<link>http://zetahype.wordpress.com/2008/06/23/making-it-count-the-pigeonhole-principle/#comment-8</link>
		<dc:creator>Tobias</dc:creator>
		<pubDate>Mon, 23 Jun 2008 19:14:18 +0000</pubDate>
		<guid isPermaLink="false">http://zetahype.wordpress.com/?p=5#comment-8</guid>
		<description>why the different fonts?</description>
		<content:encoded><![CDATA[<p>why the different fonts?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
