Deprecated: Assigning the return value of new by reference is deprecated in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/cache.php on line 36

Deprecated: Assigning the return value of new by reference is deprecated in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/query.php on line 21

Deprecated: Assigning the return value of new by reference is deprecated in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/theme.php on line 507

Warning: Cannot modify header information - headers already sent by (output started at /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/cache.php:36) in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/feed-atom.php on line 2
<?xml version="1.0" encoding="UTF-8"?><feed
  xmlns="http://www.w3.org/2005/Atom"
  xmlns:thr="http://purl.org/syndication/thread/1.0"
  xml:lang="en"
  xml:base="http://dahoiv.net/programmering/wp-atom.php"
   >
	<title type="text">Programming</title>
	<subtitle type="text">- My programming projects and some linux tips</subtitle>

	<updated>2008-12-20T13:37:45Z</updated>
	<generator uri="http://wordpress.org/" version="2.2.1">WordPress</generator>

	<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering" />
	<id>http://dahoiv.net/programmering/feed/atom</id>
	<link rel="self" type="application/atom+xml" href="http://dahoiv.net/programmering/feed/atom" />

			<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Bash script for SFV and uncompressing of .r00 files - NEW VERSION]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files-new-version" />
		<id>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files-new-version</id>
		<updated>2008-12-20T13:32:59Z</updated>
		<published>2008-12-20T13:32:59Z</published>
		<category scheme="http://dahoiv.net/programmering" term="GNU/Linux" /><category scheme="http://dahoiv.net/programmering" term="Bash" />		<summary type="html"><![CDATA[A bash script to verify the integrity of files on Linux. Simple file verification (SFV)  is file format to store CRC32 checksums. If the checksums is correct, then the script will uncompress the files. The script can be used at files of format .rar, .r00, .r01 etc and with a .sfv file. This is [...]]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Get Ip address]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/bash/get-ip-address" />
		<id>http://dahoiv.net/programmering/bash/get-ip-address</id>
		<updated>2008-08-08T20:02:48Z</updated>
		<published>2008-08-08T20:02:48Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Perl" /><category scheme="http://dahoiv.net/programmering" term="GNU/Linux" /><category scheme="http://dahoiv.net/programmering" term="Bash" />		<summary type="html"><![CDATA[If you have a server with a dynamical ip address. You can use this script to get the ip address to your mail box. Maybe you have to change the smtp-server to your ISP&#8217;s smtp-server. Run &#8220;sudo crontab -e&#8221; and add &#8220;00  *    *     *     *   ~/scripts/ip&#8221; to get an email every hour.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[How to disable caps lock in Linux]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/gnulinux/how-to-disable-caps-lock-in-linux" />
		<id>http://dahoiv.net/programmering/gnulinux/how-to-disable-caps-lock-in-linux</id>
		<updated>2008-08-03T07:46:00Z</updated>
		<published>2008-08-03T07:46:00Z</published>
		<category scheme="http://dahoiv.net/programmering" term="GNU/Linux" />		<summary type="html"><![CDATA[If you want to disable the caps lock. Open the ~/.bashrc file and add:
    # Disables the caps lock button
    xmodmap -e "remove lock = Caps_Lock"
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[How to install Code::Blocks]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/how-to-install-codeblocks" />
		<id>http://dahoiv.net/programmering/gnulinux/how-to-install-codeblocks</id>
		<updated>2008-07-24T17:41:12Z</updated>
		<published>2008-07-24T17:41:12Z</published>
		<category scheme="http://dahoiv.net/programmering" term="GNU/Linux" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[Code::Blocks is a great IDE for C++. Here is a guide to install Code::Blocks in Linux.
Open a Terminal (Applications -&#62; Accessories), and wright:
sudo gedit /etc/apt/sources.list
add these lines to the end of the file:
deb http://lgp203.free.fr/ubuntu/ gutsy universe
deb http://apt.wxwidgets.org/ gutsy-wx main
In the Terminal:
wget -q http://lgp203.free.fr/public.key -O- &#124; sudo apt-key add -
wget -q http://apt.wxwidgets.org/key.asc -O- &#124; sudo apt-key [...]]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[My .emacs file]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/gnulinux/my-emacs-file" />
		<id>http://dahoiv.net/programmering/gnulinux/my-emacs-file</id>
		<updated>2008-06-26T04:49:34Z</updated>
		<published>2008-06-26T04:49:34Z</published>
		<category scheme="http://dahoiv.net/programmering" term="GNU/Linux" />		<summary type="html"><![CDATA[Here is my .emacs file. Copy it to ~/ and it will modify your emacs.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Numerical solution of the stationary advection diffusion equation.]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/matlab/numerical-solution-of-the-stationary-advection-diffusion-equation" />
		<id>http://dahoiv.net/programmering/matlab/numerical-solution-of-the-stationary-advection-diffusion-equation</id>
		<updated>2008-06-23T19:09:28Z</updated>
		<published>2008-06-23T19:09:28Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Matlab" />		<summary type="html"><![CDATA[The stationary advection diffusion equation solved with the finite difference method.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Bash script for SFV and uncompressing of .r00 files]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files" />
		<id>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files</id>
		<updated>2008-06-14T18:03:09Z</updated>
		<published>2008-06-14T18:03:09Z</published>
		<category scheme="http://dahoiv.net/programmering" term="GNU/Linux" /><category scheme="http://dahoiv.net/programmering" term="Bash" />		<summary type="html"><![CDATA[A bash script to verify the integrity of files on Linux. Simple file verification (SFV)  is file format to store CRC32 checksums. If the checksums is correct, then the script will uncompress the files. The script can be used at files of format .rar, .r00, .r01 etc and with a .sfv file.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Steepest Descent Iteration]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/matlab/steepest-descent-iteration" />
		<id>http://dahoiv.net/programmering/matlab/steepest-descent-iteration</id>
		<updated>2008-06-07T13:28:04Z</updated>
		<published>2008-06-07T13:28:04Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Matlab" />		<summary type="html"><![CDATA[Steepest Descent Iteration ,  written   in Matlab to solve the Advection-diffusion equation. The matrix A (in A x= b) is a block pentadiagonal matrix.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Successive over-relaxation]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/matlab/successive-over-relaxation" />
		<id>http://dahoiv.net/programmering/uncategorized/successive-over-relaxation</id>
		<updated>2008-06-02T17:17:45Z</updated>
		<published>2008-06-02T17:17:45Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Matlab" />		<summary type="html"><![CDATA[Successive over-relaxation (SOR),  written   in Matlab to solve the Advection-diffusion equation. The matrix A (in A x= b) is a block pentadiagonal matrix.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Quick sort]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/uncategorized/quick-sort" />
		<id>http://dahoiv.net/programmering/uncategorized/quick-sort</id>
		<updated>2007-09-29T17:05:54Z</updated>
		<published>2007-09-29T17:05:54Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Python" /><category scheme="http://dahoiv.net/programmering" term="Uncategorized" />		<summary type="html"><![CDATA[Quick sort in Python
def sort(A):
if len(A) &#60;= 1:
return A
small = []
middle = []
big = []
temp = int((A[0][0]+A[len(A)-1][0])/2)
for x in A:
if x[0] &#60; temp:
small.append(x)
elif x[0] == temp:
middle.append(x)
elif x[0] &#62; temp:
big.append(x)
A = sort(small)
A.extend(middle)
A.extend(sort(big))
return A
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Nim]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/nim" />
		<id>http://dahoiv.net/programmering/cpp/nim</id>
		<updated>2007-09-02T11:03:54Z</updated>
		<published>2007-09-02T11:03:54Z</published>
		<category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[Nim is a two-player game in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object. The player who take the last object loses.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 092]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-092" />
		<id>http://dahoiv.net/programmering/uncategorized/project-euler-problem-092</id>
		<updated>2007-08-01T14:25:45Z</updated>
		<published>2007-08-01T14:25:45Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.
For example,
44 -&#62; 32 -&#62; 13 -&#62; 10 -&#62; 1 -&#62; 1
85 -&#62; 89 -&#62; 145 -&#62; 42 -&#62; 20 -&#62; 4 -&#62; 16 -&#62; 37 -&#62; 58 -&#62; [...]]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 030]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-030" />
		<id>http://dahoiv.net/programmering/uncategorized/project-euler-problem-030</id>
		<updated>2007-08-01T14:24:02Z</updated>
		<published>2007-08-01T14:24:02Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
9474 = 94 + 44 + 74 + 44
As 1 = 14 is not a sum it is not included.
The sum [...]]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 015]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-015" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-015</id>
		<updated>2007-08-01T14:15:49Z</updated>
		<published>2007-08-01T14:15:49Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[Starting in the top left corner of a 2*2 grid, there are 6 routes (without backtracking) to the bottom right corner.
How many routes are there through a 20*20 grid?
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 014]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-014" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-014</id>
		<updated>2007-08-01T13:19:26Z</updated>
		<published>2007-08-01T13:19:26Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[The following iterative sequence is defined for the set of positive integers:
n -&#62;n/2 (n is even)
n -&#62;3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 -&#62; 40 -&#62; 20 -&#62; 10 -&#62; 5 -&#62; 16 -&#62; 8 -&#62; 4 -&#62; 2 -&#62; 1
It can be seen [...]]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 012]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-012" />
		<id>http://dahoiv.net/programmering/uncategorized/project-euler-problem-012</id>
		<updated>2007-08-01T13:17:03Z</updated>
		<published>2007-08-01T13:17:03Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, &#8230;
Let us list the factors of [...]]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 010]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-010" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-010</id>
		<updated>2007-08-01T13:15:59Z</updated>
		<published>2007-08-01T13:15:59Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below one million.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 009]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-009" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-009</id>
		<updated>2007-08-01T13:09:50Z</updated>
		<published>2007-08-01T13:09:50Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[A Pythagorean triplet is a set of three natural numbers, a&#60;b&#60;c, for which,
a² + b² = c²
For example, 3² + 4² = 9 + 16 = 25 = 5².
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 007]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-007" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-007</id>
		<updated>2007-08-01T13:08:11Z</updated>
		<published>2007-08-01T13:08:11Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10001st prime number?
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 006]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-006" />
		<id>http://dahoiv.net/programmering/uncategorized/project-euler-problem-006</id>
		<updated>2007-08-01T13:06:59Z</updated>
		<published>2007-08-01T13:06:59Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[The sum of the squares of the first ten natural numbers is,
1² + 2² + &#8230; + 10² = 385
The square of the sum of the first ten natural numbers is,
(1 + 2 + &#8230; + 10)² = 55² = 3025
Hence the difference between the sum of the squares of the first ten natural numbers [...]]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 005]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-005" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-005</id>
		<updated>2007-08-01T13:04:30Z</updated>
		<published>2007-08-01T13:04:30Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - problem 004]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-004" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-004</id>
		<updated>2007-08-01T12:51:07Z</updated>
		<published>2007-08-01T12:51:07Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99.
Find the largest palindrome made from the product of two 3-digit numbers.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - Problem 003]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-003" />
		<id>http://dahoiv.net/programmering/uncategorized/project-euler-problem-003</id>
		<updated>2007-08-01T12:13:17Z</updated>
		<published>2007-08-01T12:13:17Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 317584931803?
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - Problem 002]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-002" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-002</id>
		<updated>2007-08-01T11:07:18Z</updated>
		<published>2007-08-01T11:07:18Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[Each new term in the Fibonacci sequence
is generated by adding the previous two terms.
By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, &#8230;
Find the sum of all the even-valued
terms in the sequence which do not exceed one million.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[Project Euler - Problem 001]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/cpp/project-euler-problem-001" />
		<id>http://dahoiv.net/programmering/cpp/project-euler-problem-001</id>
		<updated>2007-08-01T08:57:22Z</updated>
		<published>2007-08-01T08:57:22Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Project Euler" /><category scheme="http://dahoiv.net/programmering" term="C++" />		<summary type="html"><![CDATA[If we list all the natural numbers below
10 that are multiples of 3 or 5, we get 3, 5,
6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
]]></summary>
	</entry>
		<entry>
		<author>
			<name>Daniel Høyer Iversen</name>
			<uri>http://dahoiv.net/Daniel.Hoyer.Iversen.html</uri>
		</author>
		<title type="html"><![CDATA[To tankser som har brutt sammen, og det eneste som fungerer er kanonene]]></title>
		<link rel="alternate" type="text/html" href="http://dahoiv.net/programmering/java/to-tankser-som-har-brutt-sammen-og-det-eneste-som-fungerer-er-kanonene" />
		<id>http://dahoiv.net/programmering/uncategorized/to-tankser-som-har-brutt-sammen-og-det-eneste-som-fungerer-er-kanonene</id>
		<updated>2007-08-01T07:44:30Z</updated>
		<published>2007-08-01T07:44:30Z</published>
		<category scheme="http://dahoiv.net/programmering" term="Java" />		<summary type="html"><![CDATA[Opprinnelig skrevet 03.05.2007:
Ja, da var endelig javaspillet vårt ferdig. Etter mye jobbing er det morsomt å se et resultat i hvert fall jeg er fornøyd med.
]]></summary>
	</entry>
	</feed>