<?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: Fibonacci sequence and Golden Ratio</title>
	<atom:link href="http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/feed/" rel="self" type="application/rss+xml" />
	<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/</link>
	<description>Mathematics. Programming. Entrepreneurship.</description>
	<lastBuildDate>Fri, 27 Jan 2012 12:15:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Vincent</title>
		<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/comment-page-1/#comment-34568</link>
		<dc:creator>Vincent</dc:creator>
		<pubDate>Tue, 10 Aug 2010 02:06:04 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/#comment-34568</guid>
		<description>There&#039;s not much to say for a closed form solution, kb. Check the Wikipedia page for the formula.
http://en.wikipedia.org/wiki/Fibonacci_number

I was calculating phi, so it doesn&#039;t make sense to use a closed form solution which needs phi. Besides, Patrick already gave the closed form solution above.

Hint: You&#039;ll need the Math.Pow() and Math.Sqrt() functions in C#.</description>
		<content:encoded><![CDATA[<p>There&#8217;s not much to say for a closed form solution, kb. Check the Wikipedia page for the formula.<br />
<a href="http://en.wikipedia.org/wiki/Fibonacci_number" rel="nofollow">http://en.wikipedia.org/wiki/Fibonacci_number</a></p>
<p>I was calculating phi, so it doesn&#8217;t make sense to use a closed form solution which needs phi. Besides, Patrick already gave the closed form solution above.</p>
<p>Hint: You&#8217;ll need the Math.Pow() and Math.Sqrt() functions in C#.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: kb</title>
		<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/comment-page-1/#comment-34567</link>
		<dc:creator>kb</dc:creator>
		<pubDate>Mon, 09 Aug 2010 01:48:41 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/#comment-34567</guid>
		<description>Could you please show how to translate a close form solution in a C# method plz?

Thanks</description>
		<content:encoded><![CDATA[<p>Could you please show how to translate a close form solution in a C# method plz?</p>
<p>Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Math Wizard - Possibly the smartest character build ever &#124; Honeybeech</title>
		<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/comment-page-1/#comment-6261</link>
		<dc:creator>Math Wizard - Possibly the smartest character build ever &#124; Honeybeech</dc:creator>
		<pubDate>Thu, 10 Dec 2009 08:34:29 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/#comment-6261</guid>
		<description>[...] be on par with a striker for damage using a controller. Gives you an incentive to brush up on your Fibonacci numbers, doesn&#8217;t [...]</description>
		<content:encoded><![CDATA[<p>[...] be on par with a striker for damage using a controller. Gives you an incentive to brush up on your Fibonacci numbers, doesn&#8217;t [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vincent Tan</title>
		<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/comment-page-1/#comment-5565</link>
		<dc:creator>Vincent Tan</dc:creator>
		<pubDate>Wed, 06 May 2009 15:11:34 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/#comment-5565</guid>
		<description>Thanks Patrick for the closed form solution. I was focused on the iterative programmatic approach, and I left that out.</description>
		<content:encoded><![CDATA[<p>Thanks Patrick for the closed form solution. I was focused on the iterative programmatic approach, and I left that out.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick Cox</title>
		<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/comment-page-1/#comment-5563</link>
		<dc:creator>Patrick Cox</dc:creator>
		<pubDate>Tue, 05 May 2009 23:31:14 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/#comment-5563</guid>
		<description>Reading through your post, I expected to also see the closed form solution for the Fibonacci sequence. The cool thing is that it uses the golden ratio.

F(n) = ((phi)^n-(1-phi)^n)/sqrt(5)

Where phi=(1+sqrt(5))/2 a.k.a. the Golden Ratio and F(n) is the nth term in the Fibonacci sequence.</description>
		<content:encoded><![CDATA[<p>Reading through your post, I expected to also see the closed form solution for the Fibonacci sequence. The cool thing is that it uses the golden ratio.</p>
<p>F(n) = ((phi)^n-(1-phi)^n)/sqrt(5)</p>
<p>Where phi=(1+sqrt(5))/2 a.k.a. the Golden Ratio and F(n) is the nth term in the Fibonacci sequence.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vincent Tan</title>
		<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/comment-page-1/#comment-5389</link>
		<dc:creator>Vincent Tan</dc:creator>
		<pubDate>Mon, 26 Jan 2009 09:14:53 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/#comment-5389</guid>
		<description>Anonymous, 144 rabbits at the end of 12 months assume that the Fibonacci ruling starts at 1, as in
1,1,2,3,5,8,13,21,34,55,89,144

The rabbit example makes use of the Fibonacci algorithm, not the usual Fibonacci sequence. So it&#039;s
2,4,6,10,16,26,42,68,110,178,288,466

Besides, there&#039;s a flaw with the sequence you&#039;re proposing... the rabbit population cannot spawn from just one rabbit. Thanks for pointing it out though!</description>
		<content:encoded><![CDATA[<p>Anonymous, 144 rabbits at the end of 12 months assume that the Fibonacci ruling starts at 1, as in<br />
1,1,2,3,5,8,13,21,34,55,89,144</p>
<p>The rabbit example makes use of the Fibonacci algorithm, not the usual Fibonacci sequence. So it&#8217;s<br />
2,4,6,10,16,26,42,68,110,178,288,466</p>
<p>Besides, there&#8217;s a flaw with the sequence you&#8217;re proposing&#8230; the rabbit population cannot spawn from just one rabbit. Thanks for pointing it out though!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/comment-page-1/#comment-5388</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Sun, 25 Jan 2009 16:40:17 +0000</pubDate>
		<guid isPermaLink="false">http://polymathprogrammer.com/2008/01/28/fibonacci-sequence-golden-ratio/#comment-5388</guid>
		<description>after 12 months there would be 144 rabbits not 466. if you find the 12th number of the fibonacci sequrnce then this is proved</description>
		<content:encoded><![CDATA[<p>after 12 months there would be 144 rabbits not 466. if you find the 12th number of the fibonacci sequrnce then this is proved</p>
]]></content:encoded>
	</item>
</channel>
</rss>

