<?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/"
	>

<channel>
	<title>0xDEADBEEF &#187; Project Euler</title>
	<atom:link href="http://deadbeef.psychotomy.net/category/project-euler/feed/" rel="self" type="application/rss+xml" />
	<link>http://deadbeef.psychotomy.net</link>
	<description>Geek Chic?  Or just Geek!</description>
	<lastBuildDate>Sat, 30 Mar 2013 04:06:15 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
		<item>
		<title>Project Euler Problem</title>
		<link>http://deadbeef.psychotomy.net/2008/10/project-euler-problem/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=project-euler-problem</link>
		<comments>http://deadbeef.psychotomy.net/2008/10/project-euler-problem/#comments</comments>
		<pubDate>Thu, 09 Oct 2008 02:12:08 +0000</pubDate>
		<dc:creator>attriel</dc:creator>
				<category><![CDATA[Externally Sourced]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://deadbeef.psychotomy.net/?p=55</guid>
		<description><![CDATA[So, from a post on another blog (Out of All the Possible Answers), I followed a link to Project Euler &#8230;  And then I read it to Kiir.  The problem is to find the smallest number evenly divisble by all the numbers from 1-20.  We decided that it didn&#8217;t mean at the same time, since that&#8217;s [...]]]></description>
				<content:encoded><![CDATA[<p>So, from a post on another blog (<a href="http://thedailywtf.com/Articles/Out-of-All-the-Possible-Answers.aspx" target="_blank">Out of All the Possible Answers</a>), I followed a link to <a href="http://projecteuler.net/index.php?section=problems&amp;id=5" target="_blank">Project Euler</a> &#8230; </p>
<p>And then I read it to Kiir.  The problem is to find the smallest number evenly divisble by all the numbers from 1-20.  We decided that it didn&#8217;t mean at the same time, since that&#8217;s factorial <img src='http://deadbeef.psychotomy.net/wp-includes/images/smilies/icon_surprised.gif' alt=':o' class='wp-smiley' /> </p>
<p>And then &#8230; *sigh* I felt compelled to find the answer.  My answer and logic after the break</p>
<p><span id="more-55"></span>Basically what I did was try to figure out, roughly and quickly, what the minimum value would be.</p>
<p>I took 20, because it gave me 20 10 5 4 2 1, good start.  Then I took 9, which gives me 9 and 3.</p>
<p>From those two 6 15 12 and 18 &#8220;fall out&#8221; (the combination of values, 3*2, 3*5, 3*4, 9*2)</p>
<p>Then I needed the prime numbers (7 11 13 17 19) because they can&#8217;t be dodged.  They&#8217;re prime, after all.</p>
<p>After that I&#8217;m missing 16 and 8, so I multiplied by 4 (combined with the 2 and 4 from the 20 to give 8 and 16).</p>
<p>Then I realized that I maybe didn&#8217;t need the 20, so I took the primes, 5 9 and 16.</p>
<p>Both answers gave me 232,792,560 (well, the second way gave me a smaller number, but that was because I forgot the 7)</p>
<p>So &#8230; that&#8217;s my answer.</p>
]]></content:encoded>
			<wfw:commentRss>http://deadbeef.psychotomy.net/2008/10/project-euler-problem/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>
