<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Feynman&#8217;s Puzzle</title>
	<atom:link href="http://programmingpraxis.com/2009/06/12/feynmans-puzzle/feed/" rel="self" type="application/rss+xml" />
	<link>http://programmingpraxis.com/2009/06/12/feynmans-puzzle/</link>
	<description>A collection of etudes, updated weekly, for the education and enjoyment of the savvy programmer</description>
	<lastBuildDate>Sat, 11 Feb 2012 09:48:16 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: OraQA &#187; Blog Archive &#187; How to solve the Feynman&#8217;s Puzzle in SQL</title>
		<link>http://programmingpraxis.com/2009/06/12/feynmans-puzzle/#comment-1313</link>
		<dc:creator><![CDATA[OraQA &#187; Blog Archive &#187; How to solve the Feynman&#8217;s Puzzle in SQL]]></dc:creator>
		<pubDate>Wed, 09 Jun 2010 15:47:30 +0000</pubDate>
		<guid isPermaLink="false">http://programmingpraxis.wordpress.com/?p=736#comment-1313</guid>
		<description><![CDATA[[...] The following is an interesting puzzle posted on the programming praxis website:  Feynman’s Puzzle [...]]]></description>
		<content:encoded><![CDATA[<p>[...] The following is an interesting puzzle posted on the programming praxis website:  Feynman’s Puzzle [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Remco Niemeijer</title>
		<link>http://programmingpraxis.com/2009/06/12/feynmans-puzzle/#comment-168</link>
		<dc:creator><![CDATA[Remco Niemeijer]]></dc:creator>
		<pubDate>Fri, 12 Jun 2009 12:46:58 +0000</pubDate>
		<guid isPermaLink="false">http://programmingpraxis.wordpress.com/?p=736#comment-168</guid>
		<description><![CDATA[My Haskell solution (see http://bonsaicode.wordpress.com/2009/06/12/programming-praxis-feynman%E2%80%99s-puzzle/ for a version with comments):

[sourcecode lang=&#039;css&#039;]
digit :: Int -&gt; Int -&gt; Int
nth `digit` n = n `mod` 10 ^ nth `div` 10 ^ (nth - 1)

feinman :: [(Int, Int)]
feinman = [ (n1, n2)
          &#124; b &lt;- [1..9], a &lt;- [0..9], c &lt;- [0..9],
            d &lt;- [1..9], e &lt;- [0..9], f &lt;- [0..9],
            a /= b, a /= c, a /= d, a /= e, a /= f, e &lt; d,
            let n1 = 100 * b + 10 * a + c,
            let n2 = 1000 * d + 100 * e + 10 * a + f,
            n1 * n2 &gt; 999999, n1 * n2 &lt; 10000000,
            digit 3 (n1 * n2) == a,
            digit 1 (d * n1) == a, digit 2 (d * n1) == a,
            digit 1 (e * n1) == a, digit 3 (a * n1) == a]

main :: IO ()
main = print feinman
[/sourcecode]]]></description>
		<content:encoded><![CDATA[<p>My Haskell solution (see <a href="http://bonsaicode.wordpress.com/2009/06/12/programming-praxis-feynman%E2%80%99s-puzzle/" rel="nofollow">http://bonsaicode.wordpress.com/2009/06/12/programming-praxis-feynman%E2%80%99s-puzzle/</a> for a version with comments):</p>
<pre class="brush: css;">
digit :: Int -&gt; Int -&gt; Int
nth `digit` n = n `mod` 10 ^ nth `div` 10 ^ (nth - 1)

feinman :: [(Int, Int)]
feinman = [ (n1, n2)
          | b &lt;- [1..9], a &lt;- [0..9], c &lt;- [0..9],
            d &lt;- [1..9], e &lt;- [0..9], f &lt;- [0..9],
            a /= b, a /= c, a /= d, a /= e, a /= f, e &lt; d,
            let n1 = 100 * b + 10 * a + c,
            let n2 = 1000 * d + 100 * e + 10 * a + f,
            n1 * n2 &gt; 999999, n1 * n2 &lt; 10000000,
            digit 3 (n1 * n2) == a,
            digit 1 (d * n1) == a, digit 2 (d * n1) == a,
            digit 1 (e * n1) == a, digit 3 (a * n1) == a]

main :: IO ()
main = print feinman
</pre>
]]></content:encoded>
	</item>
	<item>
		<title>By: Programming Praxis &#8211; Feynman’s Puzzle &#171; Bonsai Code</title>
		<link>http://programmingpraxis.com/2009/06/12/feynmans-puzzle/#comment-167</link>
		<dc:creator><![CDATA[Programming Praxis &#8211; Feynman’s Puzzle &#171; Bonsai Code]]></dc:creator>
		<pubDate>Fri, 12 Jun 2009 12:46:33 +0000</pubDate>
		<guid isPermaLink="false">http://programmingpraxis.wordpress.com/?p=736#comment-167</guid>
		<description><![CDATA[[...] Praxis &#8211; Feynman’s&#160;Puzzle By Remco Niemeijer  Today’s Programming Praxis problem is about a long division puzzle by Richard Feynman. The provided [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Praxis &#8211; Feynman’s&nbsp;Puzzle By Remco Niemeijer  Today’s Programming Praxis problem is about a long division puzzle by Richard Feynman. The provided [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

