<?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: Zimaths</title>
	<atom:link href="http://www.bit-player.org/2008/zimaths/feed" rel="self" type="application/rss+xml" />
	<link>http://bit-player.org/2008/zimaths</link>
	<description>An amateur's outlook on computation and mathematics.</description>
	<pubDate>Tue, 07 Feb 2012 07:02:09 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.3</generator>
		<item>
		<title>By: Barry Cipra</title>
		<link>http://bit-player.org/2008/zimaths#comment-1864</link>
		<dc:creator>Barry Cipra</dc:creator>
		<pubDate>Fri, 19 Dec 2008 17:13:19 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1864</guid>
		<description>Zac's generating function is a *great* way to organize the calculation, much better than the ad hoc approach I originally took.

A little finagling with the various terms, using the identity x^10 = 1, shows that the final polynomial is
x^3 (1+x^2)^6 (1+x^4)^4
From Pascal's triangle one gets
(1+x^2)^6 = 7 + 7x^2 + 15x^4 + 20x^6 + 15x^8
and
(1+x^4)^4 = 1 + 4x^2 + 4x^4 + x^6 + 6x^8
Everything else can now be done with fairly simple arithmetic.  The coefficient of x^3 in the final result, for example, is
7 + 42 + 15 + 80 + 60 = 204.
However, this seems to only make it more mysterious as to why the final numbers come out so nearly equal!</description>
		<content:encoded><![CDATA[<p>Zac&#8217;s generating function is a *great* way to organize the calculation, much better than the ad hoc approach I originally took.</p>
<p>A little finagling with the various terms, using the identity x^10 = 1, shows that the final polynomial is<br />
x^3 (1+x^2)^6 (1+x^4)^4<br />
From Pascal&#8217;s triangle one gets<br />
(1+x^2)^6 = 7 + 7x^2 + 15x^4 + 20x^6 + 15x^8<br />
and<br />
(1+x^4)^4 = 1 + 4x^2 + 4x^4 + x^6 + 6x^8<br />
Everything else can now be done with fairly simple arithmetic.  The coefficient of x^3 in the final result, for example, is<br />
7 + 42 + 15 + 80 + 60 = 204.<br />
However, this seems to only make it more mysterious as to why the final numbers come out so nearly equal!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Zac</title>
		<link>http://bit-player.org/2008/zimaths#comment-1863</link>
		<dc:creator>Zac</dc:creator>
		<pubDate>Fri, 19 Dec 2008 08:56:54 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1863</guid>
		<description>The "easier way" that I would use is a generating series for each term's "bag".

1: x^1
2: (x^2 + x^4 + x^6 + x^8)
3: ...

Multiply them all together, and set x^10 = 1 since you only care about the last digit.  The coeffiecient of each number is the weighting for that value.  Of course, this basically does the same as your "[Tally [ Flatten [ Outer [ PlusMod ...", but you can do it by hand, if you're comfortable multiplying polynomials with 5 terms :)

204x + 204x^3 + 205x^5 + 206x^7 + 205x^9</description>
		<content:encoded><![CDATA[<p>The &#8220;easier way&#8221; that I would use is a generating series for each term&#8217;s &#8220;bag&#8221;.</p>
<p>1: x^1<br />
2: (x^2 + x^4 + x^6 + x^8)<br />
3: &#8230;</p>
<p>Multiply them all together, and set x^10 = 1 since you only care about the last digit.  The coeffiecient of each number is the weighting for that value.  Of course, this basically does the same as your &#8220;[Tally [ Flatten [ Outer [ PlusMod &#8230;&#8221;, but you can do it by hand, if you&#8217;re comfortable multiplying polynomials with 5 terms :)</p>
<p>204x + 204x^3 + 205x^5 + 206x^7 + 205x^9</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Barry Cipra</title>
		<link>http://bit-player.org/2008/zimaths#comment-1862</link>
		<dc:creator>Barry Cipra</dc:creator>
		<pubDate>Wed, 17 Dec 2008 20:37:00 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1862</guid>
		<description>If you're interested, here's a variation on the original problem that's a little trickier:

Let a, b, c, etc. be randomly (and independently) chosen from the set {1,2,3,...,100}.  What is the probability that 
1^a + 2^b + 3^c + 4^d + 5^e + 6^f + 7^g + 8^h + 9^i
has units digit equal to 5?  Is there some units digit that's more likely than any other (and if so, which one)?

Note that the powers here are drawn between 1 and 100, not between 0 and 99.  Your Mathematica simulation should have no problem estimating the probability, but it may have a hard time answering the follow-up question.</description>
		<content:encoded><![CDATA[<p>If you&#8217;re interested, here&#8217;s a variation on the original problem that&#8217;s a little trickier:</p>
<p>Let a, b, c, etc. be randomly (and independently) chosen from the set {1,2,3,&#8230;,100}.  What is the probability that<br />
1^a + 2^b + 3^c + 4^d + 5^e + 6^f + 7^g + 8^h + 9^i<br />
has units digit equal to 5?  Is there some units digit that&#8217;s more likely than any other (and if so, which one)?</p>
<p>Note that the powers here are drawn between 1 and 100, not between 0 and 99.  Your Mathematica simulation should have no problem estimating the probability, but it may have a hard time answering the follow-up question.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Barry Cipra</title>
		<link>http://bit-player.org/2008/zimaths#comment-1861</link>
		<dc:creator>Barry Cipra</dc:creator>
		<pubDate>Wed, 17 Dec 2008 13:55:45 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1861</guid>
		<description>I see I should have read the other comments more carefully before making my own.  I basically restated what svat had to say.</description>
		<content:encoded><![CDATA[<p>I see I should have read the other comments more carefully before making my own.  I basically restated what svat had to say.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Barry Cipra</title>
		<link>http://bit-player.org/2008/zimaths#comment-1860</link>
		<dc:creator>Barry Cipra</dc:creator>
		<pubDate>Wed, 17 Dec 2008 13:46:45 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1860</guid>
		<description>You could have realized that your answer 1/5 has to be wrong without ever computing what the correct answer is.  Here's how.

As soon as you determine that the units digit in the powers of 3 and 7 repeats every four steps, then, since 4 divides 100, it's no longer necessary to choose at random from 0 to 99, it suffices to choose from 0 to 3 (or 1 to 4).  This reduces the number of combinations from 10,000 to 16, all equally likely, some number of which -- lets call it k -- have the desired property.  It doesn't really matter what this desired property is, the probability of its occurrence is k/16.  And here's the rub:  There's no way a fraction with denominator 16 can reduce to one with denominator 5.  (The fancy name for this is the Fundamental Theorem of Arithmetic.)

Note, this doesn't tell you *where* you went wrong in your solution, it merely tells you that you *did* go wrong.</description>
		<content:encoded><![CDATA[<p>You could have realized that your answer 1/5 has to be wrong without ever computing what the correct answer is.  Here&#8217;s how.</p>
<p>As soon as you determine that the units digit in the powers of 3 and 7 repeats every four steps, then, since 4 divides 100, it&#8217;s no longer necessary to choose at random from 0 to 99, it suffices to choose from 0 to 3 (or 1 to 4).  This reduces the number of combinations from 10,000 to 16, all equally likely, some number of which &#8212; lets call it k &#8212; have the desired property.  It doesn&#8217;t really matter what this desired property is, the probability of its occurrence is k/16.  And here&#8217;s the rub:  There&#8217;s no way a fraction with denominator 16 can reduce to one with denominator 5.  (The fancy name for this is the Fundamental Theorem of Arithmetic.)</p>
<p>Note, this doesn&#8217;t tell you *where* you went wrong in your solution, it merely tells you that you *did* go wrong.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: svat</title>
		<link>http://bit-player.org/2008/zimaths#comment-1859</link>
		<dc:creator>svat</dc:creator>
		<pubDate>Wed, 17 Dec 2008 03:00:07 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1859</guid>
		<description>How do you think that error could have been avoided? 

(Perhaps by being more systematic about making that list, or by writing that list with an "open mind" instead of using it to verify a conjecture, so that the fact that your answer was 2/10 instead of something/16 would have tipped you off?)</description>
		<content:encoded><![CDATA[<p>How do you think that error could have been avoided? </p>
<p>(Perhaps by being more systematic about making that list, or by writing that list with an &#8220;open mind&#8221; instead of using it to verify a conjecture, so that the fact that your answer was 2/10 instead of something/16 would have tipped you off?)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nemo</title>
		<link>http://bit-player.org/2008/zimaths#comment-1858</link>
		<dc:creator>Nemo</dc:creator>
		<pubDate>Wed, 17 Dec 2008 00:38:00 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1858</guid>
		<description>7 = -3 (mod 10)</description>
		<content:encoded><![CDATA[<p>7 = -3 (mod 10)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rob Blake</title>
		<link>http://bit-player.org/2008/zimaths#comment-1857</link>
		<dc:creator>Rob Blake</dc:creator>
		<pubDate>Tue, 16 Dec 2008 23:48:43 +0000</pubDate>
		<guid isPermaLink="false">http://bit-player.org/?p=224#comment-1857</guid>
		<description>There's a mistake in your thinking regarding the list 1 digit sums mod 10.  When you perform the final ones addition, you're twice as likely to add a 1 and a 3 than you are to add a 1 and a 1.  If you write out the full table of all combinations, you'll see that the result 0 has 4 possible combinations and the other even numbers have 3 possible combinations, leading to a total of 16 combinations.  Therefore the probability distribution should be:

0 = 4/16
2,4,6,8 = 3/16

Your graph confirms this.</description>
		<content:encoded><![CDATA[<p>There&#8217;s a mistake in your thinking regarding the list 1 digit sums mod 10.  When you perform the final ones addition, you&#8217;re twice as likely to add a 1 and a 3 than you are to add a 1 and a 1.  If you write out the full table of all combinations, you&#8217;ll see that the result 0 has 4 possible combinations and the other even numbers have 3 possible combinations, leading to a total of 16 combinations.  Therefore the probability distribution should be:</p>
<p>0 = 4/16<br />
2,4,6,8 = 3/16</p>
<p>Your graph confirms this.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

