<?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: Connecting Fibonacci and geometric sequences</title>
	<atom:link href="http://www.johndcook.com/blog/2009/05/11/fibonacci-geometric-series/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2009/05/11/fibonacci-geometric-series/</link>
	<description>The blog of John D. Cook</description>
	<lastBuildDate>Sat, 11 Feb 2012 01:10:06 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Math At Play Blog Carnival #7 - Onomatopoeia</title>
		<link>http://www.johndcook.com/blog/2009/05/11/fibonacci-geometric-series/comment-page-1/#comment-17488</link>
		<dc:creator>Math At Play Blog Carnival #7 - Onomatopoeia</dc:creator>
		<pubDate>Fri, 15 May 2009 10:02:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=2245#comment-17488</guid>
		<description>[...] Cook presents Connecting Fibonacci and geometric sequences — The Endeavour posted at The [...]</description>
		<content:encoded><![CDATA[<p>[...] Cook presents Connecting Fibonacci and geometric sequences — The Endeavour posted at The [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Reid</title>
		<link>http://www.johndcook.com/blog/2009/05/11/fibonacci-geometric-series/comment-page-1/#comment-17369</link>
		<dc:creator>Mark Reid</dc:creator>
		<pubDate>Wed, 13 May 2009 00:21:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=2245#comment-17369</guid>
		<description>@Wedge, that&#039;s one way to prove it but the approach I had in mind doesn&#039;t need to invoke an extra proposition about Fibonacci sequence (though that is yet another nice relationship between them and the golden ratio).

Notice that R_{n+1} := F_{n+1} / F_n = (F_n + F_{n-1}) / F_n = 1 + F_{n-1}/F_n = 1 + 1/R_n. The limit R of the sequence R_n is a fixed point of this recurrence. That is, R = 1 + 1/R and so R^2 = R + 1 which is exactly the equation defining φ.</description>
		<content:encoded><![CDATA[<p>@Wedge, that&#8217;s one way to prove it but the approach I had in mind doesn&#8217;t need to invoke an extra proposition about Fibonacci sequence (though that is yet another nice relationship between them and the golden ratio).</p>
<p>Notice that R_{n+1} := F_{n+1} / F_n = (F_n + F_{n-1}) / F_n = 1 + F_{n-1}/F_n = 1 + 1/R_n. The limit R of the sequence R_n is a fixed point of this recurrence. That is, R = 1 + 1/R and so R^2 = R + 1 which is exactly the equation defining φ.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Wedge</title>
		<link>http://www.johndcook.com/blog/2009/05/11/fibonacci-geometric-series/comment-page-1/#comment-17356</link>
		<dc:creator>Wedge</dc:creator>
		<pubDate>Tue, 12 May 2009 20:04:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=2245#comment-17356</guid>
		<description>@Mark the reason why the ratio of successive members of the Fibonacci series tends towards the golden ratio is because the sequence can be expressed as a linear combination of the above geometric sequences of phi and phi&#039;. Specifically, there is an explicit formula for elements in the Fibonacci series, being: F(n) = phi^n/sqrt(5) - (-phi)^(-n)/sqrt(5) (this is also detailed in the &quot;Fibonacci numbers at work&quot; post), note that (-phi)^(-n) = (phi&#039;)^n, so this translates to (phi^n - phi&#039;^n)/sqrt(5)

Thus, the ratio of F(n+1) to F(n) is equal to (phi^(n+1) - phi&#039;(^n+1))/(phi^n - phi&#039;^n). Since abs(phi&#039;) &lt; 1, phi&#039;^n will trend towards 0 as n gets larger, and this ratio will trend toward phi^(n+1)/phi^n, which is just phi.</description>
		<content:encoded><![CDATA[<p>@Mark the reason why the ratio of successive members of the Fibonacci series tends towards the golden ratio is because the sequence can be expressed as a linear combination of the above geometric sequences of phi and phi&#8217;. Specifically, there is an explicit formula for elements in the Fibonacci series, being: F(n) = phi^n/sqrt(5) &#8211; (-phi)^(-n)/sqrt(5) (this is also detailed in the &#8220;Fibonacci numbers at work&#8221; post), note that (-phi)^(-n) = (phi&#8217;)^n, so this translates to (phi^n &#8211; phi&#8217;^n)/sqrt(5)</p>
<p>Thus, the ratio of F(n+1) to F(n) is equal to (phi^(n+1) &#8211; phi&#8217;(^n+1))/(phi^n &#8211; phi&#8217;^n). Since abs(phi&#8217;) &lt; 1, phi&#8217;^n will trend towards 0 as n gets larger, and this ratio will trend toward phi^(n+1)/phi^n, which is just phi.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Reid</title>
		<link>http://www.johndcook.com/blog/2009/05/11/fibonacci-geometric-series/comment-page-1/#comment-17316</link>
		<dc:creator>Mark Reid</dc:creator>
		<pubDate>Tue, 12 May 2009 03:26:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=2245#comment-17316</guid>
		<description>Another, and perhaps more direct, relationship between the original Fibonacci sequence F_1, F_2, ... and the golden ratio is that the limit of F_{n+1}/F_n as n goes to infinity is φ.  This is quite easy to prove given the observation you have already made about the golden ratio.

Another beautiful property of the golden ratio that you can arrive at easily is that it has, in some sense, the simplest continued fraction expansion: [1; 1, 1, ...].</description>
		<content:encoded><![CDATA[<p>Another, and perhaps more direct, relationship between the original Fibonacci sequence F_1, F_2, &#8230; and the golden ratio is that the limit of F_{n+1}/F_n as n goes to infinity is φ.  This is quite easy to prove given the observation you have already made about the golden ratio.</p>
<p>Another beautiful property of the golden ratio that you can arrive at easily is that it has, in some sense, the simplest continued fraction expansion: [1; 1, 1, ...].</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.399 seconds -->

