<?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: Probability of Divisibility</title>
	<atom:link href="http://www.mathteacherctk.com/blog/2009/05/probability-of-divisibility/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.mathteacherctk.com/blog/2009/05/probability-of-divisibility/</link>
	<description>Thoughts on math education and related tidbits</description>
	<lastBuildDate>Fri, 20 Jan 2012 11:38:59 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: admin</title>
		<link>http://www.mathteacherctk.com/blog/2009/05/probability-of-divisibility/comment-page-1/#comment-1805</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Tue, 15 Dec 2009 13:34:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathteacherctk.com/blog/?p=62#comment-1805</guid>
		<description>Quite right. Just to make it clear, a possibly intimidating problem of placing 10 digits into empty 10 spaces to obtain a 28-digit number, proves to be rather a dud: however the digits are placed the resulting number will always be divisible by 396. But such a realization may only be based on a solid understanding of the divisibility criteria.</description>
		<content:encoded><![CDATA[<p>Quite right. Just to make it clear, a possibly intimidating problem of placing 10 digits into empty 10 spaces to obtain a 28-digit number, proves to be rather a dud: however the digits are placed the resulting number will always be divisible by 396. But such a realization may only be based on a solid understanding of the divisibility criteria.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sol Lederman</title>
		<link>http://www.mathteacherctk.com/blog/2009/05/probability-of-divisibility/comment-page-1/#comment-1804</link>
		<dc:creator>Sol Lederman</dc:creator>
		<pubDate>Tue, 15 Dec 2009 04:45:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathteacherctk.com/blog/?p=62#comment-1804</guid>
		<description>The probability is 1.

Let n be the big number.

396 = 4*9*11.

Since 4, 9 and 11 are relatively prime, if 4 &#124; n and 9 &#124; n and 11 &#124; n then 396 &#124; n.

4 &#124; n iff 4 &#124; 76, which it does.

9 &#124; n iff the sum of the digits of n is a multiple of 9. The sum = 135 which is a multiple of 9.

11 &#124; n iff the alternating sum of the digits of n is a multiple of 11.

If the missing digits are d1, d2, ..., d10 then the alternating sum of the digits of n is:

5-d1+3-8+3-d2+8-d3+2-d4+9-3+6-d5+5-d6+8-d7+2-0+3-d8+9-d9+3-d10+7-6 = 5+3+3+8+2+9+6+5+8+2+3+9+3+7-(d1+8+d2+d3+d4+3+d5+d6+d7+0+d8+d9+d10+6) = 73 - 17 - sum(d1 .. d10) = 56-45 = 11.

So, because the alternating sum of the digits of 9 is 11, which is a multiple of 11, and because 4 &#124; n and 9 &#124; n, 396 &#124; n.</description>
		<content:encoded><![CDATA[<p>The probability is 1.</p>
<p>Let n be the big number.</p>
<p>396 = 4*9*11.</p>
<p>Since 4, 9 and 11 are relatively prime, if 4 | n and 9 | n and 11 | n then 396 | n.</p>
<p>4 | n iff 4 | 76, which it does.</p>
<p>9 | n iff the sum of the digits of n is a multiple of 9. The sum = 135 which is a multiple of 9.</p>
<p>11 | n iff the alternating sum of the digits of n is a multiple of 11.</p>
<p>If the missing digits are d1, d2, ..., d10 then the alternating sum of the digits of n is:</p>
<p>5-d1+3-8+3-d2+8-d3+2-d4+9-3+6-d5+5-d6+8-d7+2-0+3-d8+9-d9+3-d10+7-6 = 5+3+3+8+2+9+6+5+8+2+3+9+3+7-(d1+8+d2+d3+d4+3+d5+d6+d7+0+d8+d9+d10+6) = 73 - 17 - sum(d1 .. d10) = 56-45 = 11.</p>
<p>So, because the alternating sum of the digits of 9 is 11, which is a multiple of 11, and because 4 | n and 9 | n, 396 | n.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

