<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.7" -->
<rss version="0.92">
<channel>
	<title>Daniel Pedigo</title>
	<link>http://www.danielpedigo.com</link>
	<description></description>
	<lastBuildDate>Sat, 03 Jan 2009 01:09:46 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Challenging Websites</title>
		<description>As most of you can tell, I've been pretty fascinated with Project Euler for quite some time (I have a lot more challenges done than I've actually posted).  However, these last few weeks I've been neglecting Project Euler and keeping myself busy with a few other "challenge"-type websites that I've ...</description>
		<link>http://www.danielpedigo.com/2009/01/02/challenging-websites/</link>
			</item>
	<item>
		<title>Project Euler: Problem #11</title>
		<description>I've been so preoccupied as of late that I've completely neglected the website!  I'll try to be a little better in the future.  So anyways, I've finally got around to posting the answer to Problem 11.  It's not at all a hard problem, in fact, I think ...</description>
		<link>http://www.danielpedigo.com/2008/11/28/project-euler-problem-11/</link>
			</item>
	<item>
		<title>Project Euler: Problem #10</title>
		<description>Okay, slightly off topic, but I've got to throw this out there.  Never, ever, ever write something that people will see when it's late at night and you're tired.  If you're me, you will not only incorrectly express your feelings due to your terrible writing skills, but you'll ...</description>
		<link>http://www.danielpedigo.com/2008/11/19/project-euler-problem-10/</link>
			</item>
	<item>
		<title>Project Euler: Problem #9</title>
		<description>Ahh, one of the most well-known theorems in math it seems: The Pythagorean theorem.  This is a nice and easy problem to solve using a good ol' brute force algorithm.

Problem #9
Description: Find the only Pythagorean triplet, {a, b, c}, for which a + b + c = 1000.&#160;

int ProblemNine()
{
 ...</description>
		<link>http://www.danielpedigo.com/2008/11/17/project-euler-problem-9/</link>
			</item>
	<item>
		<title>Project Euler: Problem #8</title>
		<description>Due to the size of the number provided in the problem, and the fact that I've yet to find a decent big integer library to use, I ended up treating this number as a character array and just converting groups of five into numbers as I need them.  Not ...</description>
		<link>http://www.danielpedigo.com/2008/11/14/project-euler-problem-8/</link>
			</item>
	<item>
		<title>Website Updates</title>
		<description>I decided that instead of solving and posting a Euler Project problem tonight, I would spend some time updating a few areas of my blog that have been neglected as of late.   I have re-posted my game of Tic Tac Toe and updated the project page that links to it.  ...</description>
		<link>http://www.danielpedigo.com/2008/11/13/website-updates/</link>
			</item>
	<item>
		<title>Project Euler: Problem #7</title>
		<description>Work has been rather busy as of late and as a result my lunch breaks have been shorter than normal, which means that I don't have as much free time to do these little problems.  Luckily, I had enough time to complete this problem during lunch and some time ...</description>
		<link>http://www.danielpedigo.com/2008/11/12/project-euler-problem-7/</link>
			</item>
	<item>
		<title>Project Euler: Problem #6</title>
		<description>Not really much to say about this problem as it was very straightforward.  Reading the code should be more than enough to figure it out.  I guess we'll just have to wait for a more exciting problem.

Problem #6
Description: Find the difference between the sum of the squares of ...</description>
		<link>http://www.danielpedigo.com/2008/11/11/project-euler-problem-6/</link>
			</item>
	<item>
		<title>Project Euler: Problem #5</title>
		<description>Here is actually the problem that originally turned me onto Project Euler.  The idea here is to find the smallest number that can be divided evenly by the numbers one through twenty.  Now, the beginner might think to check each number against the numbers one through twenty until ...</description>
		<link>http://www.danielpedigo.com/2008/11/07/project-euler-problem-5/</link>
			</item>
	<item>
		<title>Project Euler: Problem #4</title>
		<description>While the code below is not the most elegant, it's definitely functional and to be fair, was written in maybe 10 minutes.  Regardless, I'm really looking forward to some of these upcoming problems!  Some of them are looking HARD.

Problem #4Description: Find the largest palindrome made from the product ...</description>
		<link>http://www.danielpedigo.com/2008/11/06/project-euler-problem-4/</link>
			</item>
</channel>
</rss>
