<?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/"
		>
<channel>
	<title>Comments on: &#8220;The numbers don&#8217;t tally!&#8221; &#8211; a serial counting problem</title>
	<atom:link href="http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/feed/" rel="self" type="application/rss+xml" />
	<link>http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/</link>
	<description>Where entrepreneurship, mathematics and programming meet</description>
	<lastBuildDate>Wed, 28 Mar 2012 04:44:06 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Vincent</title>
		<link>http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/comment-page-1/#comment-8524</link>
		<dc:creator>Vincent</dc:creator>
		<pubDate>Thu, 11 Feb 2010 12:23:46 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=1552#comment-8524</guid>
		<description>Will, the farmer might be exercising artistic creativity.

&quot;There should be 6 fenceposts! You left out one at that end!&quot;
&quot;I wanted to express the concept of never-ending in my own way. So I deliberately left the end post out.&quot;
&quot;Oh you&#039;re just being cheap...&quot;
&quot;If you say so...&quot;</description>
		<content:encoded><![CDATA[<p>Will, the farmer might be exercising artistic creativity.</p>
<p>&#8220;There should be 6 fenceposts! You left out one at that end!&#8221;<br />
&#8220;I wanted to express the concept of never-ending in my own way. So I deliberately left the end post out.&#8221;<br />
&#8220;Oh you&#8217;re just being cheap&#8230;&#8221;<br />
&#8220;If you say so&#8230;&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Will Dwinnell</title>
		<link>http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/comment-page-1/#comment-8516</link>
		<dc:creator>Will Dwinnell</dc:creator>
		<pubDate>Thu, 11 Feb 2010 11:57:41 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=1552#comment-8516</guid>
		<description>I&#039;ve heard this referred to as a &quot;fencepost error&quot;, in reference to old questions like &quot;A farmer wants to put up a 50 foot length of fence, with a fencepost every 10 feet.  How many fenceposts will he need?&quot;  One natural response is to divide to get 5, but this of course neglects the very first fencepost.</description>
		<content:encoded><![CDATA[<p>I&#8217;ve heard this referred to as a &#8220;fencepost error&#8221;, in reference to old questions like &#8220;A farmer wants to put up a 50 foot length of fence, with a fencepost every 10 feet.  How many fenceposts will he need?&#8221;  One natural response is to divide to get 5, but this of course neglects the very first fencepost.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vincent Tan</title>
		<link>http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/comment-page-1/#comment-5945</link>
		<dc:creator>Vincent Tan</dc:creator>
		<pubDate>Mon, 05 Oct 2009 16:44:48 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=1552#comment-5945</guid>
		<description>That&#039;s true. I remember reading a paper by a famous programmer. Donald Knuth? Bjarne Stroustrup?

That person wrote a paper comparing the pros and cons of 0-indexing and 1-indexing, and finally concluded that 0-indexing is the most efficient or something.

Maybe I read that from codinghorror.com or something...</description>
		<content:encoded><![CDATA[<p>That&#8217;s true. I remember reading a paper by a famous programmer. Donald Knuth? Bjarne Stroustrup?</p>
<p>That person wrote a paper comparing the pros and cons of 0-indexing and 1-indexing, and finally concluded that 0-indexing is the most efficient or something.</p>
<p>Maybe I read that from codinghorror.com or something&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve</title>
		<link>http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/comment-page-1/#comment-5944</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Mon, 05 Oct 2009 15:49:02 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=1552#comment-5944</guid>
		<description>In computer programming, this &quot;0-based&quot; versus &quot;1-based&quot; problem comes up often.  For instance, in C, to define an int array with 10 elements, you use:

int C[10]

but the elements of C are C[0] (the 1st element), C[1] (the 2nd element), ... C[9] (the 10th element.)  It&#039;s tempting to ask for the 10th element of C as C[10], but that&#039;s off by one.  In fact, that&#039;s the title of the Wikipedia article about this issue:

http://en.wikipedia.org/wiki/Off-by-one_error</description>
		<content:encoded><![CDATA[<p>In computer programming, this &#8220;0-based&#8221; versus &#8220;1-based&#8221; problem comes up often.  For instance, in C, to define an int array with 10 elements, you use:</p>
<p>int C[10]</p>
<p>but the elements of C are C[0] (the 1st element), C[1] (the 2nd element), &#8230; C[9] (the 10th element.)  It&#8217;s tempting to ask for the 10th element of C as C[10], but that&#8217;s off by one.  In fact, that&#8217;s the title of the Wikipedia article about this issue:</p>
<p><a href="http://en.wikipedia.org/wiki/Off-by-one_error" rel="nofollow">http://en.wikipedia.org/wiki/Off-by-one_error</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vincent Tan</title>
		<link>http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/comment-page-1/#comment-5942</link>
		<dc:creator>Vincent Tan</dc:creator>
		<pubDate>Mon, 05 Oct 2009 13:43:20 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=1552#comment-5942</guid>
		<description>Ahh... so it&#039;s 0026 - 0006 (the serial number that&#039;s not there)

Then again, due to improper (re)education, some of us forget how to count in our double digit years... ;)</description>
		<content:encoded><![CDATA[<p>Ahh&#8230; so it&#8217;s 0026 &#8211; 0006 (the serial number that&#8217;s not there)</p>
<p>Then again, due to improper (re)education, some of us forget how to count in our double digit years&#8230; <img src='http://polymathprogrammer.com/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Eric</title>
		<link>http://polymathprogrammer.com/2009/10/05/the-numbers-dont-tally-serial-counting-problem/comment-page-1/#comment-5940</link>
		<dc:creator>Eric</dc:creator>
		<pubDate>Mon, 05 Oct 2009 13:12:44 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/?p=1552#comment-5940</guid>
		<description>This kind of counting problem can often be handled by reverting to the old &quot;take away&quot; concept that so many of us learned in our single digit years. What you should really be doing to count items in the inventory is to &quot;take away&quot; all the numbers that aren&#039;t there; don&#039;t take away the first number that is.</description>
		<content:encoded><![CDATA[<p>This kind of counting problem can often be handled by reverting to the old &#8220;take away&#8221; concept that so many of us learned in our single digit years. What you should really be doing to count items in the inventory is to &#8220;take away&#8221; all the numbers that aren&#8217;t there; don&#8217;t take away the first number that is.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

