<?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>ATL/ALT &#187; euler</title>
	<atom:link href="http://andrewtlyman.com/category/code/euler/feed/" rel="self" type="application/rss+xml" />
	<link>http://andrewtlyman.com</link>
	<description>if/else != both/and</description>
	<lastBuildDate>Thu, 01 Dec 2011 17:38:08 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.4</generator>
		<item>
		<title>30 somethings</title>
		<link>http://andrewtlyman.com/2009/07/22/30-somethings/</link>
		<comments>http://andrewtlyman.com/2009/07/22/30-somethings/#comments</comments>
		<pubDate>Wed, 22 Jul 2009 17:15:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=173</guid>
		<description><![CDATA[Two more giants fall: Project Euler 30: Find the sum of all the numbers that can be written as the sum of fifth powers of their digits. and Project Euler 34: Find the sum of all numbers which are equal to the sum of the factorial of their digits.]]></description>
			<content:encoded><![CDATA[<p>Two more giants fall:</p>
<p><a href="http://youngteammanager.com/andy/code/euler/euler30.py">Project Euler 30</a>: Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.</p>
<p>and <a href="http://youngteammanager.com/andy/code/euler/euler34.py">Project Euler 34</a>: Find the sum of all numbers which are equal to the sum of the factorial of their digits.</p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2009/07/22/30-somethings/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Again</title>
		<link>http://andrewtlyman.com/2009/07/06/project-euler-again/</link>
		<comments>http://andrewtlyman.com/2009/07/06/project-euler-again/#comments</comments>
		<pubDate>Mon, 06 Jul 2009 18:02:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=164</guid>
		<description><![CDATA[The trip to Malawi was beginning to dull the technical part of my brain (it is very small, so to neglect it and risk losing it completely would be devastating). To keep sharp I cracked back into the ole&#8217; Project Euler problems. I got two more solved by the pool in the shad of some [...]]]></description>
			<content:encoded><![CDATA[<p>The trip to Malawi was beginning to dull the technical part of my brain (it is very small, so to neglect it and risk losing it completely would be devastating). To keep sharp I cracked back into the ole&#8217; <a href="http://projecteuler.net">Project Euler</a> problems. I got two more solved by the pool in the shad of some large banana trees in Lilongwe.</p>
<p><a href="http://youngteammanager.com/andy/code/euler/euler25.py">Problem 25</a>: What is the first term in the Fibonacci sequence to contain 1000 digits?</p>
<p><a href="http://youngteammanager.com/andy/code/euler/euler48.py">Problem 48</a>: Find the last ten digits of the series, 1^(1) + 2^(2) + 3^(3) + &#8230; + 1000^(1000)</p>
<p><a href="http://youngteammanager.com/andy/euler.html">Euler Solutions Page</a></p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2009/07/06/project-euler-again/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Creeping Genius</title>
		<link>http://andrewtlyman.com/2008/07/04/the-creeping-genius/</link>
		<comments>http://andrewtlyman.com/2008/07/04/the-creeping-genius/#comments</comments>
		<pubDate>Fri, 04 Jul 2008 16:33:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=70</guid>
		<description><![CDATA[Hey! I think I&#8217;m getting better at this. Well no, probably not, I must have just hit on some easy Euler Problems. But anyway, I solved three more last night. Maybe it&#8217;s just being bored back home in Indiana. Yeah I&#8217;ll blame my increase in mental acuity on Indiana, THAT makes sense&#8230; Problem 14: Find [...]]]></description>
			<content:encoded><![CDATA[<p>Hey! I think I&#8217;m getting better at this. Well no, probably not, I must have just hit on some easy <a href="http://projecteuler.net">Euler Problems</a>. But anyway, I solved three more last night. Maybe it&#8217;s just being bored back home in Indiana. Yeah I&#8217;ll blame my increase in mental acuity on Indiana, THAT makes sense&#8230;</p>
<p><a href="http://youngteammanager.com/andy/code/euler/euler14.py">Problem 14</a>: Find the longest sequence using a starting number under one million.<br /><a href="http://youngteammanager.com/andy/code/euler/euler16.py">Problem 16</a>: What is the sum of the digits of the number 2 to the 1000th power? (Note: This was by far the easiest one I&#8217;ve done so far. Took me about 30 seconds to solve)<br /><a href="http://youngteammanager.com/andy/code/euler/euler20.py">Problem 20</a>: Find the sum of digits in 100! (Note: This was just problem 16 with one more step)</p>
<p><a href="http://youngteammanager.com/andy/euler.html">Euler Solutions</a></p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/07/04/the-creeping-genius/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Another Giant Falls</title>
		<link>http://andrewtlyman.com/2008/07/02/another-giant-falls/</link>
		<comments>http://andrewtlyman.com/2008/07/02/another-giant-falls/#comments</comments>
		<pubDate>Thu, 03 Jul 2008 04:35:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=69</guid>
		<description><![CDATA[&#8230;a giant that has been solved by only 9632 people! Take THAT stupid Project Euler 13! You were too easy, I conquered you in all of 5 minutes, and most of that was time spent adding line breaks into the horrendously large number you provided. The conundrum was such: Work out the first ten digits [...]]]></description>
			<content:encoded><![CDATA[<p>&#8230;a giant that has been solved by only 9632 people! Take THAT stupid <a href="http://projecteuler.net">Project Euler 13</a>! You were too easy, I conquered you in all of 5 minutes, and most of that was time spent adding line breaks into the horrendously large number you provided. The conundrum was such: <br />Work out the first ten digits of the sum of the following one-hundred 50-digit numbers:<br />
<blockquote>37107287533902102798797998220837590246510135740250<br />46376937677490009712648124896970078050417018260538<br />74324986199524741059474233309513058123726617309629<br />91942213363574161572522430563301811072406154908250<br />23067588207539346171171980310421047513778063246676<br />89261670696623633820136378418383684178734361726757<br />28112879812849979408065481931592621691275889832738<br />44274228917432520321923589422876796487670272189318<br />47451445736001306439091167216856844588711603153276<br />70386486105843025439939619828917593665686757934951<br />62176457141856560629502157223196586755079324193331<br />64906352462741904929101432445813822663347944758178<br />92575867718337217661963751590579239728245598838407<br />58203565325359399008402633568948830189458628227828<br />80181199384826282014278194139940567587151170094390<br />35398664372827112653829987240784473053190104293586<br />86515506006295864861532075273371959191420517255829<br />71693888707715466499115593487603532921714970056938<br />54370070576826684624621495650076471787294438377604<br />53282654108756828443191190634694037855217779295145<br />36123272525000296071075082563815656710885258350721<br />45876576172410976447339110607218265236877223636045<br />17423706905851860660448207621209813287860733969412<br />81142660418086830619328460811191061556940512689692<br />51934325451728388641918047049293215058642563049483<br />62467221648435076201727918039944693004732956340691<br />15732444386908125794514089057706229429197107928209<br />55037687525678773091862540744969844508330393682126<br />18336384825330154686196124348767681297534375946515<br />80386287592878490201521685554828717201219257766954<br />78182833757993103614740356856449095527097864797581<br />16726320100436897842553539920931837441497806860984<br />48403098129077791799088218795327364475675590848030<br />87086987551392711854517078544161852424320693150332<br />59959406895756536782107074926966537676326235447210<br />69793950679652694742597709739166693763042633987085<br />41052684708299085211399427365734116182760315001271<br />65378607361501080857009149939512557028198746004375<br />35829035317434717326932123578154982629742552737307<br />94953759765105305946966067683156574377167401875275<br />88902802571733229619176668713819931811048770190271<br />25267680276078003013678680992525463401061632866526<br />36270218540497705585629946580636237993140746255962<br />24074486908231174977792365466257246923322810917141<br />91430288197103288597806669760892938638285025333403<br />34413065578016127815921815005561868836468420090470<br />23053081172816430487623791969842487255036638784583<br />11487696932154902810424020138335124462181441773470<br />63783299490636259666498587618221225225512486764533<br />67720186971698544312419572409913959008952310058822<br />95548255300263520781532296796249481641953868218774<br />76085327132285723110424803456124867697064507995236<br />37774242535411291684276865538926205024910326572967<br />23701913275725675285653248258265463092207058596522<br />29798860272258331913126375147341994889534765745501<br />18495701454879288984856827726077713721403798879715<br />38298203783031473527721580348144513491373226651381<br />34829543829199918180278916522431027392251122869539<br />40957953066405232632538044100059654939159879593635<br />29746152185502371307642255121183693803580388584903<br />41698116222072977186158236678424689157993532961922<br />62467957194401269043877107275048102390895523597457<br />23189706772547915061505504953922979530901129967519<br />86188088225875314529584099251203829009407770775672<br />11306739708304724483816533873502340845647058077308<br />82959174767140363198008187129011875491310547126581<br />97623331044818386269515456334926366572897563400500<br />42846280183517070527831839425882145521227251250327<br />55121603546981200581762165212827652751691296897789<br />32238195734329339946437501907836945765883352399886<br />75506164965184775180738168837861091527357929701337<br />62177842752192623401942399639168044983993173312731<br />32924185707147349566916674687634660915035914677504<br />99518671430235219628894890102423325116913619626622<br />73267460800591547471830798392868535206946944540724<br />76841822524674417161514036427982273348055556214818<br />97142617910342598647204516893989422179826088076852<br />87783646182799346313767754307809363333018982642090<br />10848802521674670883215120185883543223812876952786<br />71329612474782464538636993009049310363619763878039<br />62184073572399794223406235393808339651327408011116<br />66627891981488087797941876876144230030984490851411<br />60661826293682836764744779239180335110989069790714<br />85786944089552990653640447425576083659976645795096<br />66024396409905389607120198219976047599490197230297<br />64913982680032973156037120041377903785566085089252<br />16730939319872750275468906903707539413042652315011<br />94809377245048795150954100921645863754710598436791<br />78639167021187492431995700641917969777599028300699<br />15368713711936614952811305876380278410754449733078<br />40789923115535562561142322423255033685442488917353<br />44889911501440648020369068063960672322193204149535<br />41503128880339536053299340368006977710650566631954<br />81234880673210146739058568557934581403627822703280<br />82616570773948327592232845941706525094512325230608<br />22918802058777319719839450180888072429661980811197<br />77158542502016545090413245809786882778948721859617<br />72107838435069186155435662884062257473692284509516<br />20849603980134001723930671666823555245252804609722<br />53503534226472524250874054075591789781264330331690</p></blockquote>
<p>So I did what I was told and what have I got to show for it? Nuthin! Just this post before going to bed before going to Indianapolis.</p>
<p><a href="http://youngteammanager.com/andy/code/euler/euler13.py">My Solution</a></p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/07/02/another-giant-falls/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>According to a Website I have a Genius Rating of 5%</title>
		<link>http://andrewtlyman.com/2008/06/03/according-to-a-website-i-have-a-genius-rating-of-5/</link>
		<comments>http://andrewtlyman.com/2008/06/03/according-to-a-website-i-have-a-genius-rating-of-5/#comments</comments>
		<pubDate>Tue, 03 Jun 2008 17:30:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=64</guid>
		<description><![CDATA[The clouds have parted (even though it&#8217;s storming here right now) and allowed me to briefly glimpse the mind of god. It is an ugly beast that takes nearly a minute to solve this simple(ish) problem, and does not lend itself easily to more complex operations, but it works for what I needed it for [...]]]></description>
			<content:encoded><![CDATA[<p>The clouds have parted (even though it&#8217;s storming here right now) and allowed me to briefly glimpse the mind of god. It is an ugly beast that takes nearly a minute to solve this simple(ish) problem, and does not lend itself easily to more complex operations, but it works for what I needed it for (to advance and increase my genius rating mwah ha ha!). Thanks for helping me solve <a href="http://youngteammanager.com/andy/code/euler/euler10.py">Project Euler #10</a> god. Your aid will soon be forgotten, my increased genius ranking however, will not.<br />
<blockquote>#!/usr/bin/env python<br />#euler10.py<br />#Calculate the sum of all primes below 2,000,000</p>
<p>def main():</p>
<p>Primes = [2]<br />    n = 2<br />    sum = 2<br />    for i in range(3, 2000000):<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; while i % n != 0 and n <= 2001:<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; n += 1<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; if n == i or n > 2000:<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Primes.append(i)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; sum += i<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; else:<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; n = 2<br />    print sum</p>
<p>if __name__ == &#8216;__main__&#8217;:<br />    main()</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/06/03/according-to-a-website-i-have-a-genius-rating-of-5/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>67, 105, 112, 104, 101, 114, 105, 122, 101, 114</title>
		<link>http://andrewtlyman.com/2008/05/29/67-105-112-104-101-114-105-122-101-114/</link>
		<comments>http://andrewtlyman.com/2008/05/29/67-105-112-104-101-114-105-122-101-114/#comments</comments>
		<pubDate>Thu, 29 May 2008 20:12:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=61</guid>
		<description><![CDATA[73, 32, 102, 105, 110, 97, 108, 108, 121, 32, 102, 105, 110, 105, 115, 104, 101, 100, 32, 97, 110, 111, 116, 104, 101, 114, 32, 74, 97, 118, 97, 83, 99, 114, 105, 112, 116, 32, 98, 117, 105, 108, 100, 32, 111, 102, 32, 111, 110, 101, 32, 111, 102, 32, 109, [...]]]></description>
			<content:encoded><![CDATA[<p>73, 32, 102, 105, 110, 97, 108, 108, 121, 32, 102, 105, 110, 105, 115, 104, 101, 100, 32, 97, 110, 111, 116, 104, 101, 114, 32, 74, 97, 118, 97, 83, 99, 114, 105, 112, 116, 32, 98, 117, 105, 108, 100, 32, 111, 102, 32, 111, 110, 101, 32, 111, 102, 32, 109, 121, 32, 111, 108, 100, 32, 80, 121, 116, 104, 111, 110, 32, 112, 114, 111, 103, 114, 97, 109, 115, 46, 32, 84, 104, 101, 32, <a href="http://youngteammanager.com/andy/cipherizer.html">74, 97, 118, 97, 83, 99, 114, 105, 112, 116, 32, 67, 105, 112, 104, 101, 114, 105, 122, 101, 114</a>, 32, 105, 115, 32, 117, 112, 32, 97, 110, 32, 114, 117, 110, 110, 105, 110, 103, 46, 32, 78, 111, 119, 32, 121, 111, 117, 32, 99, 97, 110, 32, 101, 110, 99, 111, 100, 101, 32, 97, 110, 100, 32, 100, 101, 99, 111, 100, 101, 32, 115, 101, 99, 114, 101, 116, 32, 109, 101, 115, 115, 97, 103, 101, 115, 32, 102, 114, 111, 109, 32, 121, 111, 117, 114, 32, 102, 114, 105, 101, 110, 100, 115, 32, 97, 110, 100, 32, 101, 110, 101, 109, 105, 101, 115, 46, 32, 85, 110, 102, 111, 114, 116, 117, 110, 97, 116, 101, 108, 121, 32, 105, 115, 32, 105, 115, 32, 101, 97, 115, 105, 101, 114, 32, 116, 111, 32, 99, 114, 97, 99, 107, 32, 116, 104, 97, 110, 32, 116, 104, 101, 32, 80, 121, 116, 104, 111, 110, 32, 118, 101, 114, 115, 105, 111, 110, 44, 32, 97, 115, 32, 116, 104, 101, 114, 101, 32, 119, 97, 115, 32, 97, 110, 32, 101, 108, 101, 109, 101, 110, 116, 32, 111, 114, 32, 116, 119, 111, 32, 116, 104, 97, 116, 32, 73, 32, 104, 97, 118, 101, 32, 98, 101, 101, 110, 32, 117, 110, 97, 98, 108, 101, 32, 116, 111, 32, 115, 117, 99, 99, 101, 115, 115, 102, 117, 108, 108, 121, 32, 97, 112, 112, 108, 121, 32, 105, 110, 32, 116, 104, 101, 32, 74, 97, 118, 97, 83, 99, 114, 105, 112, 116, 32, 98, 117, 105, 108, 100, 32, 111, 102, 32, 116, 104, 101, 32, 112, 114, 111, 103, 114, 97, 109, 46, 32, 66, 117, 116, 32, 105, 116, 32, 119, 111, 114, 107, 115, 32, 97, 115, 32, 105, 116, 32, 115, 104, 111, 117, 108, 100, 44, 32, 97, 110, 100, 32, 105, 115, 32, 103, 117, 97, 114, 97, 110, 116, 101, 101, 100, 32, 116, 111, 32, 112, 114, 111, 118, 105, 100, 101, 32, 108, 105, 116, 101, 114, 97, 108, 108, 121, 32, 109, 111, 109, 101, 110, 116, 115, 32, 111, 102, 32, 102, 117, 110, 32, 102, 111, 114, 32, 121, 111, 117, 32, 97, 110, 100, 32, 111, 110, 101, 32, 111, 116, 104, 101, 114, 32, 112, 101, 114, 115, 111, 110, 46</p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/05/29/67-105-112-104-101-114-105-122-101-114/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>More Disgusting Solutions to Horrendous Problems</title>
		<link>http://andrewtlyman.com/2008/05/22/more-disgusting-solutions-to-horrendous-problems/</link>
		<comments>http://andrewtlyman.com/2008/05/22/more-disgusting-solutions-to-horrendous-problems/#comments</comments>
		<pubDate>Thu, 22 May 2008 21:14:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=60</guid>
		<description><![CDATA[After over a week, I have finally come up with a solution to Project Euler #3. In which I was asked to find the largest prime factor of the number 600851475143. This was a particularly nasty little bugger that gave me all sorts of hell. It took me a while in the first place to [...]]]></description>
			<content:encoded><![CDATA[<p>After over a week, I have finally come up with a solution to <a href="http://youngteammanager.com/andy/code/euler/euler3.py">Project Euler #3</a>. In which I was asked to find the largest prime factor of the number 600851475143. This was a particularly nasty little bugger that gave me all sorts of hell. It took me a while in the first place to come up with an algorithm to figure primes. I thought I was sitting pretty when I got that working, but the number they give was too big to compute with brute force, so I had to come up with a way to chop it down a bit. The solution, as you can see, is pretty messy, and I barely have a grasp on how it even works. The print out is also really quite gross, so you have to know what you&#8217;re even looking for, but it works. I&#8217;ve got my answer. I can sleep through my nights once more.</p>
<p>I&#8217;ve also managed to plow through another problem involving Primes that I had passed over, <a href="http://youngteammanager.com/andy/code/euler/euler7.py">Problem 7</a>, which by comparison seemed pretty meager simply asking me to find the 10001st Prime. No problem. Just takes a while to compute.</p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/05/22/more-disgusting-solutions-to-horrendous-problems/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>I Told You, the Math Factor</title>
		<link>http://andrewtlyman.com/2008/05/21/i-told-you-the-math-factor/</link>
		<comments>http://andrewtlyman.com/2008/05/21/i-told-you-the-math-factor/#comments</comments>
		<pubDate>Wed, 21 May 2008 14:52:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=59</guid>
		<description><![CDATA[I tried to explain that I am lousy with math, but it seemed like my head was on straight enough. However the worst of all possible nightmarishly ironic situations has occurred: my math describing how bad my math is has turned out to be incorrect. So, as a formal retraction to my claim that my [...]]]></description>
			<content:encoded><![CDATA[<p>I tried to explain that I am lousy with math, but it seemed like my head was on straight enough. However the worst of all possible nightmarishly ironic situations has occurred: my math describing how bad my math is has turned out to be incorrect. So, as a formal retraction to my claim that my solution to <a href="http://youngteammanager.com/andy/code/euler/euler9.py">Project Euler #9</a> goes through !3000 iterations to produce it&#8217;s results, I must announce that it does not. My buddy Carl tipped me off to the fact, of which I am logically aware, but chose to ignore since the thrill of stupidly large numbers was at stake, that !3000 is a number larger than the count of atoms in the universe, or grains of sand on all the World&#8217;s beaches. The correct total of iterations for this particular program is more sensible: 1,000,000,000. Which I guess is large enough, but it sure aint no <a href="http://youngteammanager.com/andy/code/euler/monster.txt">!3000</a>. However, I do trust that my skills are slowly getting less bad. It has been at least seven years since I have done any real and consistent crunching of numbers (I went to Art School remember), and it is a disappointment, but no surprise that is taking me some time to get back into the swing of things.</p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/05/21/i-told-you-the-math-factor/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Math Factor</title>
		<link>http://andrewtlyman.com/2008/05/17/the-math-factor/</link>
		<comments>http://andrewtlyman.com/2008/05/17/the-math-factor/#comments</comments>
		<pubDate>Sun, 18 May 2008 01:53:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=58</guid>
		<description><![CDATA[So in progressing through Project Euler it is becoming more and more apparent that with slightly better math skills, I could be much more efficient at this. For example, my solution to Problem 9. While the code itself may not look all that messy, this is probably the WORST way to solve this one. My [...]]]></description>
			<content:encoded><![CDATA[<p>So in progressing through <a href="http://projecteuler.net/index.php?section=about">Project Euler</a> it is becoming more and more apparent that with slightly better math skills, I could be much more efficient at this. For example, my solution to <a href="http://youngteammanager.com/andy/code/euler/euler8.py">Problem 9</a>. While the code itself may not look all that messy, this is probably the WORST way to solve this one. My computer is not very happy with me at the moment, but I got the right answer damnit! But this just goes to show you, you can get the right answer the wrong way. In this case I was trying to find the ONE Pythagorean Triplet (a < b < c where a*a + b*b = c*c) that sums to 1000. With my solution I had it running through !3000 (3000 Factorial) iterations, or, more accurately, <a href="http://youngteammanager.com/andy/code/euler/monster.txt">this lovely 9,131 digit number</a>. I&#8217;ve gotta get better at this stuff.</p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/05/17/the-math-factor/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Three More Euler Problems Solutioned</title>
		<link>http://andrewtlyman.com/2008/05/17/three-more-euler-problems-solutioned/</link>
		<comments>http://andrewtlyman.com/2008/05/17/three-more-euler-problems-solutioned/#comments</comments>
		<pubDate>Sat, 17 May 2008 15:37:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Code]]></category>
		<category><![CDATA[euler]]></category>

		<guid isPermaLink="false">http://www.youngteammanager.com/andy/wordpress/?p=57</guid>
		<description><![CDATA[Through overwhelming use of my brain powers, I have successfully (albeit, not particularly elegantly) solved three more Project Euler Problems. In Problem 5 I found the smallest integer divisible by all numbers 1 &#8211; 20. My solution to this one is TERRIBLE, but it works, so I haven&#8217;t fixed it yet. Problem 6 I found [...]]]></description>
			<content:encoded><![CDATA[<p>Through overwhelming use of my brain powers, I have successfully (albeit, not particularly elegantly) solved three more <a href="http://projecteuler.net/index.php?section=about">Project Euler Problems</a>. In <a href="http://youngteammanager.com/andy/code/euler/euler5.py">Problem 5</a> I found the smallest integer divisible by all numbers 1 &#8211; 20. My solution to this one is TERRIBLE, but it works, so I haven&#8217;t fixed it yet. <a href="http://youngteammanager.com/andy/code/euler/euler6.py">Problem 6</a> I found the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum. I&#8217;m pretty happy with my solution to that one, but I&#8217;m no expert, and I&#8217;m sure all of these can be further simplified. Last on the updates is <a href="http://youngteammanager.com/andy/code/euler/euler8.py">Problem 8</a> which came out nearly allright. I could pretty it up a bit, but it&#8217;s a decent way to muscle through this particular problem, which was to find the greatest product of five consecutive digits in the 1000-digit number given.</p>
<p>Keep in mind that there are much more intelligent humans solving these in much more intelligent ways than I am currently. I just happen to have gone slightly insane, and find it kind of fun to spend my Friday nights at home working on math problems and listening to Phil Ochs. If a version of myself were to time travel to now from the past, I&#8217;m sure he would be horrified to the point of self obliteration, and thusly eliminate all possibility of me ever falling into this lifestyle.</p>
<p><a href="http://youngteammanager.com/andy/euler.html">Project Euler Solutions</a></p>
]]></content:encoded>
			<wfw:commentRss>http://andrewtlyman.com/2008/05/17/three-more-euler-problems-solutioned/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

