<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	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>Incongruent Thoughts</title>
	<atom:link href="http://dwaynecrooks.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://dwaynecrooks.wordpress.com</link>
	<description>My musings on programming, mathematics and life</description>
	<lastBuildDate>Mon, 15 Apr 2013 11:27:17 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='dwaynecrooks.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Incongruent Thoughts</title>
		<link>http://dwaynecrooks.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://dwaynecrooks.wordpress.com/osd.xml" title="Incongruent Thoughts" />
	<atom:link rel='hub' href='http://dwaynecrooks.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Project Euler &#8211; Problem 145</title>
		<link>http://dwaynecrooks.wordpress.com/2011/05/05/project-euler-problem-145/</link>
		<comments>http://dwaynecrooks.wordpress.com/2011/05/05/project-euler-problem-145/#comments</comments>
		<pubDate>Thu, 05 May 2011 11:31:58 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>
		<category><![CDATA[p145]]></category>
		<category><![CDATA[ocaml]]></category>
		<category><![CDATA[haskell]]></category>
		<category><![CDATA[c]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=416</guid>
		<description><![CDATA[The problem: Problem 145 Analysis Suprisingly enough the brute-force solution works. It takes a couple of minutes but it gets the job done. Suppose we have a function called is_reversible then the following algorithm can be used to count all the reversible numbers below one-billion. Implementation Uses the OCaml programming language. The above code is [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=416&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2011/05/05/project-euler-problem-145/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>
	</item>
		<item>
		<title>Getting Previous Play Whe Results using Python</title>
		<link>http://dwaynecrooks.wordpress.com/2011/04/13/getting-previous-play-whe-results-using-python/</link>
		<comments>http://dwaynecrooks.wordpress.com/2011/04/13/getting-previous-play-whe-results-using-python/#comments</comments>
		<pubDate>Wed, 13 Apr 2011 21:52:21 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Hacking]]></category>
		<category><![CDATA[play whe]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=364</guid>
		<description><![CDATA[Quick Update (17th January, 2012): I have created an extension for Google Chrome that allows you to view the latest Play Whe results. Check it out here: Play Whe Results Viewer You can view even more results and statistics if you follow this link: Play Whe Smarter And finally, you can like the Play Whe [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=364&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2011/04/13/getting-previous-play-whe-results-using-python/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>

		<media:content url="http://dwaynecrooks.files.wordpress.com/2011/03/playwhe_statistics.png?w=264" medium="image">
			<media:title type="html">playwhe_statistics</media:title>
		</media:content>

		<media:content url="http://dwaynecrooks.files.wordpress.com/2011/03/pwq-april-2011.png?w=300" medium="image">
			<media:title type="html">pwq-april-2011</media:title>
		</media:content>
	</item>
		<item>
		<title>Project Euler &#8211; Trinidad and Tobago Standings</title>
		<link>http://dwaynecrooks.wordpress.com/2010/11/21/project-euler-trinidad-and-tobago-standings/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/11/21/project-euler-trinidad-and-tobago-standings/#comments</comments>
		<pubDate>Sun, 21 Nov 2010 17:18:12 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=354</guid>
		<description><![CDATA[Below is an image of the current standings in projecteuler.net as of 21/11/2010 for Trinidad and Tobago. As you can see I&#8217;m 2nd in the standings. Damn you wallygold. Lol. I need to solve 10 more problems to reach Level 3. Hopefully, I will have time to do it before the year ends. A note [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=354&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/11/21/project-euler-trinidad-and-tobago-standings/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>

		<media:content url="http://dwaynecrooks.files.wordpress.com/2010/11/project-euler-trinidad-standings-20101121.png?w=300" medium="image">
			<media:title type="html">project-euler-trinidad-standings-20101121</media:title>
		</media:content>
	</item>
		<item>
		<title>Project Euler &#8211; Problem 71</title>
		<link>http://dwaynecrooks.wordpress.com/2010/11/21/project-euler-problem-71/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/11/21/project-euler-problem-71/#comments</comments>
		<pubDate>Sun, 21 Nov 2010 16:42:30 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[Racket]]></category>
		<category><![CDATA[p71]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>
		<category><![CDATA[racket]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=311</guid>
		<description><![CDATA[The problem: Problem 71 Analysis Let be some integer larger than , and . Let be a function from to defined as follows: , where is the largest fraction in that is less than . As the example in the problem illustrates, . We need to find Let and be an integer between and inclusive. [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=311&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/11/21/project-euler-problem-71/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>
	</item>
		<item>
		<title>SICP &#8211; A Proof for Exercise 1.13</title>
		<link>http://dwaynecrooks.wordpress.com/2010/11/07/sicp-a-proof-for-exercise-1-13/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/11/07/sicp-a-proof-for-exercise-1-13/#comments</comments>
		<pubDate>Sun, 07 Nov 2010 13:45:40 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[SICP]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=267</guid>
		<description><![CDATA[Exercise 1.13 in Section 1.2.2 asks for a proof that is the closest integer to , where . Proof Idea: To show that is the closest integer to we simply need to show that for all . We will establish the result by proving two lemmas. Lemma 1: for all . Lemma 2: for all [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=267&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/11/07/sicp-a-proof-for-exercise-1-13/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>
	</item>
		<item>
		<title>Project SICP</title>
		<link>http://dwaynecrooks.wordpress.com/2010/10/23/project-sicp/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/10/23/project-sicp/#comments</comments>
		<pubDate>Sat, 23 Oct 2010 10:50:07 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Scheme]]></category>
		<category><![CDATA[SICP]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=243</guid>
		<description><![CDATA[&#8220;Structure and Interpretation of Computer Programs&#8221; is by far the greatest programming book I have ever read. The majority of other programming books don&#8217;t teach you about the big ideas in programming or about managing complexity in large software systems. These books spend most of the time teaching you about the peculiarities of the syntax [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=243&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/10/23/project-sicp/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>

		<media:content url="http://mitpress.mit.edu/sicp/full-text/book/cover.jpg" medium="image">
			<media:title type="html">SICP book cover</media:title>
		</media:content>
	</item>
		<item>
		<title>A ray tracer in Racket</title>
		<link>http://dwaynecrooks.wordpress.com/2010/10/15/a-ray-tracer-in-racket/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/10/15/a-ray-tracer-in-racket/#comments</comments>
		<pubDate>Fri, 15 Oct 2010 14:21:12 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Racket]]></category>
		<category><![CDATA[Ray Tracing]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=228</guid>
		<description><![CDATA[Racket is a very cool programming language based on the scheme/lisp family of languages. For the past couple of months I&#8217;ve been having lots of fun implementing and re-implementing various programs in Racket. My latest project is a ray tracer. A ray tracer is a program for generating realistic images. The code I&#8217;m writing for [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=228&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/10/15/a-ray-tracer-in-racket/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>

		<media:content url="http://dwaynecrooks.files.wordpress.com/2010/10/first.png?w=300" medium="image">
			<media:title type="html">first</media:title>
		</media:content>
	</item>
		<item>
		<title>Tic-tac-toe in Scala &#8211; Part 1</title>
		<link>http://dwaynecrooks.wordpress.com/2010/07/28/tic-tac-toe-in-scala-part-1/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/07/28/tic-tac-toe-in-scala-part-1/#comments</comments>
		<pubDate>Wed, 28 Jul 2010 15:58:24 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Scala]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[scala]]></category>
		<category><![CDATA[tic-tac-toe]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=181</guid>
		<description><![CDATA[What is Tic-tac-toe? Tic-tac-toe is a two player turn based game played on a 3&#215;3 grid with X and O tokens. Usually X plays first. The objective of the game is to be the first player to place three tokens of the same kind in a row, column or diagonal on the grid. Here is [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=181&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/07/28/tic-tac-toe-in-scala-part-1/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>

		<media:content url="http://dwaynecrooks.files.wordpress.com/2010/07/tic-tac-toe-x-wins.png" medium="image">
			<media:title type="html">tic-tac-toe-x-wins</media:title>
		</media:content>

		<media:content url="http://dwaynecrooks.files.wordpress.com/2010/07/tic-tac-toe-class-diagram.png" medium="image">
			<media:title type="html">Tic-tac-toe Class Diagram</media:title>
		</media:content>
	</item>
		<item>
		<title>Project Euler – Problem 93</title>
		<link>http://dwaynecrooks.wordpress.com/2010/07/23/project-euler-problem-93/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/07/23/project-euler-problem-93/#comments</comments>
		<pubDate>Sat, 24 Jul 2010 00:34:39 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[lisp]]></category>
		<category><![CDATA[p93]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=113</guid>
		<description><![CDATA[The problem: Problem 93 Analysis This problem was straight-forward to solve and only required the use of some standard algorithms. A quick analysis shows that a brute-force method suffices to find the solution. Let be a subset of . There are such subsets. Let be a permutation on . Clearly, there are such permutations. For [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=113&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/07/23/project-euler-problem-93/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>
	</item>
		<item>
		<title>Scala: My new favorite programming language</title>
		<link>http://dwaynecrooks.wordpress.com/2010/07/21/scala-my-new-favorite-programming-language/</link>
		<comments>http://dwaynecrooks.wordpress.com/2010/07/21/scala-my-new-favorite-programming-language/#comments</comments>
		<pubDate>Thu, 22 Jul 2010 02:05:40 +0000</pubDate>
		<dc:creator>dwayne</dc:creator>
				<category><![CDATA[Scala]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[scala]]></category>

		<guid isPermaLink="false">http://dwaynecrooks.wordpress.com/?p=99</guid>
		<description><![CDATA[A little less than two weeks ago I came across the Scala programming language. Since then I&#8217;ve been intensely learning the language and becoming familiar with the Scala way of doing things. I have never had this much fun on the JVM before. The language was relatively easy to learn and I was productive in [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=dwaynecrooks.wordpress.com&#038;blog=11611430&#038;post=99&#038;subd=dwaynecrooks&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://dwaynecrooks.wordpress.com/2010/07/21/scala-my-new-favorite-programming-language/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/8e5e8015f4baa06f4de88e4a9de7a601?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">dwaynecrooks</media:title>
		</media:content>
	</item>
	</channel>
</rss>
