Talk:Fibonacci sequence

Example of Implementation in Programming

Seeing as calculation of the Fibonacci Number is a fundamental problem in recursive computer programming, I would find it only appropriate that this page contain at least one example implementation. I feel that many people looking into the Fibonacci Sequence may have some computer background and a quick topic containing some basic code to calculate it, ideally in a functional programming language, would be of great use to them. I would be more than happy to write this up and add it, but as somewhat of a newcomer to the contribution side of Wikipedia I felt it appropriate that I gauge people's feelings on this matter first. Thoughts? — Preceding unsigned comment added by Swat510 (talk • contribs) 07:00, 6 August 2011 (UTC)

Thanks for coming here first. Fibonacci number#External links has the box to the right with a link to a page which was originally a Wikipedia article at Fibonacci number program, but it was transwikied to Wikibooks at Wikipedia:Articles for deletion/Fibonacci number program (2 nomination). There are still several examples at Recursion (computer science)#Fibonacci where it seems more appropriate for the purpose you mention. I have added a link to Fibonacci number#See also. This seems sufficient for this article which is not suppsed to be about programming. PrimeHunter (talk) 14:02, 6 August 2011 (UTC)

Ah, nifty. Didn't see that before. I agree the Recursion topic makes more sense.

Citation to Binet's vs. Abraham de Moivre's formula

In paragraph Fibonacci_number#Closed-form_expression citation is needed for disambiguation that closed-form formula was introduces by Abraham de Moivre and not Jacques Philippe Marie Binet. It can be found in the book The_Art_of_Computer_Programming and I think this book should be cited. — Preceding unsigned comment added by Milikicn (talk • contribs) 18:30, 19 August 2011 (UTC)

Simple is best

To initially demonstrate the relationship between the Fibonacci sequence and the Golden Ratio, the Kepler solution is clearly the best. It is the simplest, clearest and most obvious therefore the most elegant solution. The other solutions are definitely worthy of mention but they are needlessly complex answers where a direct answer to a very simple question is already available. The Kepler solution should be the first listed followed by the Binet. Wading through the Binet solution only to find the obvious and to the point Kepler solution leads the reader to conclude that he has stumbled upon an Asperger's self stroking fest rather than an encyclopedia.74.178.137.190 (talk) 11:00, 4 September 2011 (UTC)

Editors here are unlikely to take your suggestions seriously if you cannot express them without throwing in gratuitous playground insults. Gandalf61 (talk) 12:47, 4 September 2011 (UTC)

Identities and combinatorial interpretations

There are two problems with the beginning of the "Identities" section. (1) The first sentence of this section asserts that "Most identities involving Fibonacci numbers draw from combinatorial arguments." This statement sounds subjective; unless reinforced by strong evidence I would remove it. In any case it's irrelevant to the statement of identities. (2) The first identity cannot be proved, as it is the definition. The proper way to handle it is to prove the "interpretation" given (without proof) in the previous section. That should be in a separate section on "Combinatorial interpretations of the Fibonacci numbers". Zaslav (talk) 01:29, 24 October 2011 (UTC)

1/89

The linked page misleadingly suggests that a certain Cody Birsner discovered the relationship between the series and the fraction, whereas it had been known for a considerable time before. Perhaps it would be better to link to another page, e.g. http://www.goldennumber.net/Number89.htm or http://www.fibonacci.name/1-89.html or http://www.mathpages.com/home/kmath108.htm Dadge (talk) 20:50, 31 December 2011 (UTC)

I agree. Thanks for pointing this out. I changed it to:

Köhler, Günter (1985). "Generating functions of Fibonacci-like sequences and decimal expansions of some fractions" (PDF). The Fibonacci Quarterly. 23 (1): 29–35. Retrieved December 31, 2011. {{cite journal}}: Unknown parameter |month= ignored (help)

which in turn cites some earlier papers from FQ. —Mark Dominus (talk) 22:04, 31 December 2011 (UTC)

add some formulas and proofs

put the even,odd,odd,even pattern on the article.and proofs.and before you do this:is there a pattern like this?yes or no and why?John kaiser (talk) 06:08, 30 January 2012 (UTC)