<?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: A Programming Excercise</title>
	<atom:link href="http://danielmiessler.com/blog/a-programming-excercise/feed" rel="self" type="application/rss+xml" />
	<link>http://danielmiessler.com/blog/a-programming-excercise</link>
	<description>grep understanding</description>
	<lastBuildDate>Tue, 15 May 2012 12:09:13 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Ken</title>
		<link>http://danielmiessler.com/blog/a-programming-excercise/comment-page-1#comment-1500</link>
		<dc:creator>Ken</dc:creator>
		<pubDate>Wed, 12 Oct 2005 13:47:24 +0000</pubDate>
		<guid isPermaLink="false">http://dmiessler.com/archives/525#comment-1500</guid>
		<description>&lt;p&gt;You comments are kinds D, but my code was getting complex fast. I think this is the most elegant solution to the problem.&lt;/p&gt;

&lt;p&gt;BTW I did find one piece on the challenge site that looked like mine in python, but was almost 40 lines when it was done. WAY TO GO DUDE!&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>You comments are kinds D, but my code was getting complex fast. I think this is the most elegant solution to the problem.</p>

<p>BTW I did find one piece on the challenge site that looked like mine in python, but was almost 40 lines when it was done. WAY TO GO DUDE!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ken</title>
		<link>http://danielmiessler.com/blog/a-programming-excercise/comment-page-1#comment-245560</link>
		<dc:creator>Ken</dc:creator>
		<pubDate>Wed, 12 Oct 2005 13:47:00 +0000</pubDate>
		<guid isPermaLink="false">http://dmiessler.com/archives/525#comment-245560</guid>
		<description>&lt;p&gt;You comments are kinds D, but my code was getting complex fast. I think this is the most elegant solution to the problem.&lt;/p&gt;

&lt;p&gt;BTW I did find one piece on the challenge site that looked like mine in python, but was almost 40 lines when it was done. WAY TO GO DUDE!&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>You comments are kinds D, but my code was getting complex fast. I think this is the most elegant solution to the problem.</p>

<p>BTW I did find one piece on the challenge site that looked like mine in python, but was almost 40 lines when it was done. WAY TO GO DUDE!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Carl M</title>
		<link>http://danielmiessler.com/blog/a-programming-excercise/comment-page-1#comment-1498</link>
		<dc:creator>Carl M</dc:creator>
		<pubDate>Wed, 12 Oct 2005 11:43:28 +0000</pubDate>
		<guid isPermaLink="false">http://dmiessler.com/archives/525#comment-1498</guid>
		<description>&lt;p&gt;If I am reading your code correctly, it finds ONE magic number for each of the numbers from 2 to 9.  (This is in fact what the instructions required.)  But, my question is:  Are the answers unique?  Extend that question a little bit ... 
for an integer, i,  from 1 to 9 (note that I started at 1), how many six digit numbers have the property that they are equal to their digit reversal when multiplied by i?  PERHAPS the answer is that there is only one such six digit number for each of the numbers from 2 to 9, but there are certainly MANY when i=1.  How many?&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>If I am reading your code correctly, it finds ONE magic number for each of the numbers from 2 to 9.  (This is in fact what the instructions required.)  But, my question is:  Are the answers unique?  Extend that question a little bit &#8230; 
for an integer, i,  from 1 to 9 (note that I started at 1), how many six digit numbers have the property that they are equal to their digit reversal when multiplied by i?  PERHAPS the answer is that there is only one such six digit number for each of the numbers from 2 to 9, but there are certainly MANY when i=1.  How many?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Carl M</title>
		<link>http://danielmiessler.com/blog/a-programming-excercise/comment-page-1#comment-245559</link>
		<dc:creator>Carl M</dc:creator>
		<pubDate>Wed, 12 Oct 2005 11:43:00 +0000</pubDate>
		<guid isPermaLink="false">http://dmiessler.com/archives/525#comment-245559</guid>
		<description>&lt;p&gt;If I am reading your code correctly, it finds ONE magic number for each of the numbers from 2 to 9.  (This is in fact what the instructions required.)  But, my question is:  Are the answers unique?  Extend that question a little bit ... 
for an integer, i,  from 1 to 9 (note that I started at 1), how many six digit numbers have the property that they are equal to their digit reversal when multiplied by i?  PERHAPS the answer is that there is only one such six digit number for each of the numbers from 2 to 9, but there are certainly MANY when i=1.  How many?&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>If I am reading your code correctly, it finds ONE magic number for each of the numbers from 2 to 9.  (This is in fact what the instructions required.)  But, my question is:  Are the answers unique?  Extend that question a little bit &#8230; 
for an integer, i,  from 1 to 9 (note that I started at 1), how many six digit numbers have the property that they are equal to their digit reversal when multiplied by i?  PERHAPS the answer is that there is only one such six digit number for each of the numbers from 2 to 9, but there are certainly MANY when i=1.  How many?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

