<?xml version="1.0" encoding="UTF-8"?><rss version="0.92">
<channel>
	<title>Occam&#039;s Razor</title>
	<link>http://developmentgeek.com/blog</link>
	<description>Fueled by Mt. Dew and a love for technology</description>
	<lastBuildDate>Tue, 13 Jul 2010 15:39:34 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	<!-- generator="WordPress/4393" -->

	<item>
		<title>XNABEE</title>
		<description><![CDATA[A friend of mine made his first open source project on Codeplex, XNABEE. He uses a tool from Microsoft called XNA for making DirectX-based games. For basic effects on lighting, textures, etc., you have to make a change, recompile, and see if it was what you wanted. Major pain. He made an external tool that [...]]]></description>
		<link>http://developmentgeek.com/blog/20100712/xnabee/</link>
			</item>
	<item>
		<title>C-Sharp.  C-Sharp Run.</title>
		<description><![CDATA[I HATE OLD VB! A pet-peeve of mine is when I work on code that written with legacy VB6-style methods and functions rather than the more current .NET versions. Is there a huge performance penalty between calling Len() on a string versus .Length and that sort of thing? Not really. I mean, I&#8217;m sure there [...]]]></description>
		<link>http://developmentgeek.com/blog/20100613/c-sharp-run/</link>
			</item>
	<item>
		<title>Problem 019</title>
		<description><![CDATA[You are given the following information, but you may prefer to do some research for yourself. * 1 Jan 1900 was a Monday. * Thirty days has September, April, June and November. All the rest have thirty-one, Saving February alone, Which has twenty-eight, rain or shine. And on leap years, twenty-nine. * A leap year [...]]]></description>
		<link>http://developmentgeek.com/blog/20100316/problem-019/</link>
			</item>
	<item>
		<title>Problem 014</title>
		<description><![CDATA[The following iterative sequence is defined for the set of positive integers: n → n/2 (n is even) n → 3n + 1 (n is odd) Using the rule above and starting with 13, we generate the following sequence: 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → [...]]]></description>
		<link>http://developmentgeek.com/blog/20100316/problem-014/</link>
			</item>
	<item>
		<title>Problem 011</title>
		<description><![CDATA[In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 [...]]]></description>
		<link>http://developmentgeek.com/blog/20100313/problem-011/</link>
			</item>
	<item>
		<title>Problem 010</title>
		<description><![CDATA[The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. Solution: Function Prob010() As Long For k As Integer = 2 To 2000000 If IsPrime(k) Then Prob010 += k Next End Function Summary: They are making this WAY [...]]]></description>
		<link>http://developmentgeek.com/blog/20100311/problem-010/</link>
			</item>
	<item>
		<title>Problem 009</title>
		<description><![CDATA[A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a^(2) + b^(2) = c^(2) For example, 3^(2) + 4^(2) = 9 + 16 = 25 = 5^(2). There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc. Solution: [...]]]></description>
		<link>http://developmentgeek.com/blog/20100311/problem-009/</link>
			</item>
	<item>
		<title>Problem 008</title>
		<description><![CDATA[Find the greatest product of five consecutive digits in the 1000-digit number. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 71636269561882670428252483600823257530420752963450 Solution: Function Prob008() As Long Dim strInput As New System.Text.StringBuilder strInput.Append("73167176531330624919225119674426574742355349194934") strInput.Append("96983520312774506326239578318016984801869478851843") strInput.Append("85861560789112949495459501737958331952853208805511") strInput.Append("12540698747158523863050715693290963295227443043557") strInput.Append("66896648950445244523161731856403098711121722383113") strInput.Append("62229893423380308135336276614282806444486645238749") strInput.Append("30358907296290491560440772390713810515859307960866") strInput.Append("70172427121883998797908792274921901699720888093776") strInput.Append("65727333001053367881220235421809751254540594752243") strInput.Append("52584907711670556013604839586446706324415722155397") strInput.Append("53697817977846174064955149290862569321978468622482") strInput.Append("83972241375657056057490261407972968652414535100474") strInput.Append("82166370484403199890008895243450658541227588666881") [...]]]></description>
		<link>http://developmentgeek.com/blog/20100311/problem-008/</link>
			</item>
	<item>
		<title>Problem 007</title>
		<description><![CDATA[By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6^(th) prime is 13. What is the 10001^(st) prime number? Solution: Function Prob007() As Long Dim k As Integer = 1 Dim PrimeCount As Integer = 0 Dim TargetPrime As Integer = 10001 While PrimeCount < [...]]]></description>
		<link>http://developmentgeek.com/blog/20100310/problem-007/</link>
			</item>
	<item>
		<title>Problem 006</title>
		<description><![CDATA[The sum of the squares of the first ten natural numbers is, 1^(2) + 2^(2) + &#8230; + 10^(2) = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + &#8230; + 10)^(2) = 55^(2) = 3025 Hence the difference between the sum of the squares of the [...]]]></description>
		<link>http://developmentgeek.com/blog/20100309/problem-006/</link>
			</item>
</channel>
</rss>
