<?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"
	>
<channel>
	<title>Comments on: CT. Odd People</title>
	<atom:link href="http://mathfactor.uark.edu/2007/08/20/ct-odd-people/feed/" rel="self" type="application/rss+xml" />
	<link>http://mathfactor.uark.edu/2007/08/20/ct-odd-people/</link>
	<description>The Math Factor Podcast Site</description>
	<pubDate>Fri, 04 Jul 2008 02:51:50 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: strauss</title>
		<link>http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-118</link>
		<dc:creator>strauss</dc:creator>
		<pubDate>Fri, 31 Aug 2007 15:01:36 +0000</pubDate>
		<guid isPermaLink="false">http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-118</guid>
		<description>--- but is it necessarily so, that someone &lt;i&gt; must &lt;/i&gt; remain dry, regardless of how the folks are arranged?</description>
		<content:encoded><![CDATA[<p>&#8212; but is it necessarily so, that someone <i> must </i> remain dry, regardless of how the folks are arranged?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: giorgis</title>
		<link>http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-117</link>
		<dc:creator>giorgis</dc:creator>
		<pubDate>Fri, 31 Aug 2007 10:33:11 +0000</pubDate>
		<guid isPermaLink="false">http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-117</guid>
		<description>If a bunch of people are on the circumference of a circle with one poor fellow at the center, as long as they a little more than r appart everybody shoots the dude at the center. You put equispaced 5 to a circle, the dude in the center gets it, and only one on the rim gets it leaving 4 out of six dry. 
(An even number of people though)


Giorgis</description>
		<content:encoded><![CDATA[<p>If a bunch of people are on the circumference of a circle with one poor fellow at the center, as long as they a little more than r appart everybody shoots the dude at the center. You put equispaced 5 to a circle, the dude in the center gets it, and only one on the rim gets it leaving 4 out of six dry.<br />
(An even number of people though)</p>
<p>Giorgis</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: kraDen</title>
		<link>http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-116</link>
		<dc:creator>kraDen</dc:creator>
		<pubDate>Mon, 27 Aug 2007 11:22:55 +0000</pubDate>
		<guid isPermaLink="false">http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-116</guid>
		<description>Hi,
Though a straight line can hardly be considered random (unless we are dealing with a 1 dimensional world) I see your point. Based on my new understanding I reread the question and thought about why you had specified an â€˜oddâ€™ number of people. That along with my original pairing idea Has put me onto what I think is the right track.

â€˜Oddâ€™ is necessary to avoid the situation where people are in a configuration where they do pair up. So with an even number of people everyone could get shot.

So if we now take another look at the puzzle. We can eliminate those who form pairs as the shoot each other.  We are sure that no larger self groups of equidistant people exist by the condition that â€˜there is a unique closest person to squirtâ€™. We are now left with a group again containing an odd number of people that do not pair up (i.e. in no case will the person you shoot be shooting back). Of these remaining group there must be one who is the furthest from any one else. By definition they can not be shot as all the rest are closer to someone else.

It is possible with certain layouts that multiple people may not be shot but the above shows that we a guaranteed of at least 1.

Cheers
Ken</description>
		<content:encoded><![CDATA[<p>Hi,<br />
Though a straight line can hardly be considered random (unless we are dealing with a 1 dimensional world) I see your point. Based on my new understanding I reread the question and thought about why you had specified an â€˜oddâ€™ number of people. That along with my original pairing idea Has put me onto what I think is the right track.</p>
<p>â€˜Oddâ€™ is necessary to avoid the situation where people are in a configuration where they do pair up. So with an even number of people everyone could get shot.</p>
<p>So if we now take another look at the puzzle. We can eliminate those who form pairs as the shoot each other.  We are sure that no larger self groups of equidistant people exist by the condition that â€˜there is a unique closest person to squirtâ€™. We are now left with a group again containing an odd number of people that do not pair up (i.e. in no case will the person you shoot be shooting back). Of these remaining group there must be one who is the furthest from any one else. By definition they can not be shot as all the rest are closer to someone else.</p>
<p>It is possible with certain layouts that multiple people may not be shot but the above shows that we a guaranteed of at least 1.</p>
<p>Cheers<br />
Ken</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: strauss</title>
		<link>http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-115</link>
		<dc:creator>strauss</dc:creator>
		<pubDate>Sun, 26 Aug 2007 17:51:51 +0000</pubDate>
		<guid isPermaLink="false">http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-115</guid>
		<description>This example might help:

&lt;br /&gt;
&lt;p align = "center"&gt;&lt;img src="http://mathfactor.uark.edu/images/oddfolks1.jpg"/&gt;

&lt;br /&gt;
Folks might not pair up, and there really may be more than one dry person!&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>This example might help:</p>
<p></p>
<p align = "center"><img src="http://mathfactor.uark.edu/images/oddfolks1.jpg"/></p>
<p>
Folks might not pair up, and there really may be more than one dry person!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: kraDen</title>
		<link>http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-114</link>
		<dc:creator>kraDen</dc:creator>
		<pubDate>Fri, 24 Aug 2007 10:54:54 +0000</pubDate>
		<guid isPermaLink="false">http://mathfactor.uark.edu/2007/08/20/ct-odd-people/#comment-114</guid>
		<description>Assumption that there is a unique person to shoot at counts out the case where a number of people are at the corners of a regular polygon.
With 3 people 2 are equally close and will shoot each other. 3rd person will shoot whoever is closer of the other 2 but will remain dry.
Same argument works for any odd number of people. The fact that person A is closest to person B is an if and only if condition i.e. they will shoot each other. So if we have 2N+1  people they pair up into N pairs who shoot each other leaving 1 person left who shoots whoever they are closest too but who no one shoots.
Implies he/she remains dry.
Only thing I disagree with is that your statement "there is a unique closest person to squirt" implies that there "will always be at least
person left dry" where as in fact there will always be one and only one
person left dry. 
cheers
Ken
cheers
Ken</description>
		<content:encoded><![CDATA[<p>Assumption that there is a unique person to shoot at counts out the case where a number of people are at the corners of a regular polygon.<br />
With 3 people 2 are equally close and will shoot each other. 3rd person will shoot whoever is closer of the other 2 but will remain dry.<br />
Same argument works for any odd number of people. The fact that person A is closest to person B is an if and only if condition i.e. they will shoot each other. So if we have 2N+1  people they pair up into N pairs who shoot each other leaving 1 person left who shoots whoever they are closest too but who no one shoots.<br />
Implies he/she remains dry.<br />
Only thing I disagree with is that your statement &#8220;there is a unique closest person to squirt&#8221; implies that there &#8220;will always be at least<br />
person left dry&#8221; where as in fact there will always be one and only one<br />
person left dry.<br />
cheers<br />
Ken<br />
cheers<br />
Ken</p>
]]></content:encoded>
	</item>
</channel>
</rss>
