<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
	
	>
<channel>
	<title>
	Comments on: Project Euler Problem 2 – Fibonacci sequence	</title>
	<atom:link href="https://codepills.com/project-euler-problem-2-fibonacci-sequence/feed/" rel="self" type="application/rss+xml" />
	<link>https://codepills.com/project-euler-problem-2-fibonacci-sequence/</link>
	<description>Helping you make a better code</description>
	<lastBuildDate>Sat, 16 Jan 2016 13:10:22 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	
	<item>
		<title>
		By: Project Euler Problem 3 - Largest prime factor - CodeKopf.com		</title>
		<link>https://codepills.com/project-euler-problem-2-fibonacci-sequence/#comment-9</link>

		<dc:creator><![CDATA[Project Euler Problem 3 - Largest prime factor - CodeKopf.com]]></dc:creator>
		<pubDate>Sat, 16 Jan 2016 13:10:22 +0000</pubDate>
		<guid isPermaLink="false">http://codekopf.com/?p=379#comment-9</guid>

					<description><![CDATA[[&#8230;] get rid of the all multiple of the all previous prime numbers. Unfortunately we can not use a Fibonacci algorithm from the previous Project Euler Problem [&#8230;]]]></description>
			<content:encoded><![CDATA[<p>[&#8230;] get rid of the all multiple of the all previous prime numbers. Unfortunately we can not use a Fibonacci algorithm from the previous Project Euler Problem [&#8230;]</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
