Talk:Fibonacci sequence
This is the talk page for discussing improvements to the Fibonacci sequence article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
Archives: 1, 2, 3, 4Auto-archiving period: 90 days ![]() |
![]() | Fibonacci sequence was nominated as a Mathematics good article, but it did not meet the good article criteria at the time (April 14, 2013). There are suggestions on the review page for improving the article. If you can improve it, please do; it may then be renominated. |
![]() | This ![]() It is of interest to the following WikiProjects: | ||||||||||
|
![]() | Daily pageviews of this article
A graph should have been displayed here but graphs are temporarily disabled. Until they are enabled again, visit the interactive graph at pageviews.wmcloud.org |
Intro paragraph
[edit]There is not only one Fibonacci sequence. The sequence 2,5,7,12,19,... is a Fibonacci sequence. So I do not see why the introduction should refer to "the" Fibonacci sequence. Shouldn't it describe "a" Fibonacci sequence?
Also, it is not true that every number of a Fibonacci sequence is the sum of the two predecessors (as explained in the introduction paragraph) since the first two numbers in a sequence do not have two predecessors. Shouldn't the language be made precise?
I attempted to correct these two issues back in October 2023, but Jaybee didn't like my edits and reverted them, saying that I should not have done so. Why? Majfoster (talk) 06:37, 7 December 2023 (UTC)
- First, because Wikipedia articles must be based on the consensus of mainstream published sources, not on the idiosyncratic views of individual editors. Second, because this article is about the usual Fibonacci sequence, not other sequences defined from the same recurrence. We have a separate article for that: Generalizations of Fibonacci numbers. —David Eppstein (talk) 07:27, 7 December 2023 (UTC)
- Thank you for the feedback. I see now there is another page for the generalized sequence. I should have done my due diligence to see if it existed before making a fuss. Majfoster (talk) 16:44, 7 December 2023 (UTC)
- I agree that starting with other than 0, 1 should be in the other article.
- I've boldly made an edit to reflect the other point you make; the lead sentence now reads "In mathematics, the Fibonacci sequence is a sequence starting with 0 and 1 in which each subsequent number is the sum of the two preceding ones." For the very first sentence that may be too much information, but let's see what other editors think. —Quantling (talk | contribs) 15:08, 7 December 2023 (UTC)
- Excellent, I am am satisfied! Majfoster (talk) 16:45, 7 December 2023 (UTC)
Fibonacci numbers vs. Fibonacci sequence
[edit]We bothered to change the name of the article from Fibonacci numbers to Fibonacci sequence. However, much of the text still says things like "The Fibonacci numbers are" rather than "The Fibonacci sequence is". I realize that there are some instances where we really do mean the former, and I realize that there are some instances where changing the former to the latter would be a word salad, and I realize that we don't have to be pedantic about every occurrence ... but might it be worthwhile to change many of instances of the "Fibonacci numbers" to "Fibonacci sequence"? Or, putting it another way, if I do that, am I likely to get instantly reverted? Thanks —Quantling (talk | contribs) 14:39, 2 February 2024 (UTC)
- No big deal indeed, so no problem with me. Afaiac, go ahead
. - DVdm (talk) 15:41, 2 February 2024 (UTC)
- However, the article title and your personal preferences are not good reasons for the change, and, per MOS:VAR, you must provide stronger reasons.
- Also, the two phrases are not always equivalent. For example, in the last but one paragraph of the lead, the examples given are related to the first numbers of the sequence only, not to the whole sequence. So, I would oppose strongly to the change in this paragraph. In the last paragraph of the lead, this is different, as the Fibonacci numbers are not individually related to the golden ratio; this is the sequence that is related to it. So, in this case, I would strongly support the change. D.Lazard (talk) 16:30, 2 February 2024 (UTC)
- I agree. Of course we can only make changes where it makes sense. - DVdm (talk) 16:41, 2 February 2024 (UTC)
Fibonacci numbers are not individually related to the golden ratio
- This claim seems too broad and pretty pedantic. For example, powers of the golden ratio when written as "golden integers" of the form have "individual Fibonacci numbers" as their coefficients, as described in Fibonacci sequence § Decomposition of powers. –jacobolus (t) 17:30, 2 February 2024 (UTC)
- Of course, I would not have used this sentence in the article. However, to establish the expression of the powers of the golden ratio, one needs the recurrence relation, and thus the defition of the sequence. The fact is that it is better to use "sequence" when all numbers are considered together. So "sequence" is better in the first sentence (before the colon) and the last sentence of the last paragraph of the lead; "numbers" is better in the remainder of this paragraph. D.Lazard (talk) 17:55, 2 February 2024 (UTC)
- Did no one notice that Fibonacci numbers and Fibonacci sequence mean the exact same thing, or is it just me? 80.42.238.212 (talk) 11:26, 8 July 2024 (UTC)
- "Sequence" implies an order among the numbers ... a first Fibonacci number, then a second, then a third, .... However, "numbers" need not be so organized. For example, among the transcendental numbers, there is none that people agree is the first, then the second, etc. —Quantling (talk | contribs) 12:37, 8 July 2024 (UTC)
- Thanks; I guess that kind of helps. I only thought that because when I hovered over Fibonacci numbers and then over Fibonacci sequences, it gave the same definition. 80.42.238.212 (talk) 08:40, 10 July 2024 (UTC)
- "Sequence" implies an order among the numbers ... a first Fibonacci number, then a second, then a third, .... However, "numbers" need not be so organized. For example, among the transcendental numbers, there is none that people agree is the first, then the second, etc. —Quantling (talk | contribs) 12:37, 8 July 2024 (UTC)
possibly problematic picture placement
[edit]Before my edit, my phone (at least in portrait page orientation instead of landscape) displayed the yellow "tiles" image after the phrase "the sequence begins" but before the actual sequence of "0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...", making the page easy to misread as saying "Starting from 0 and 1, the sequence begins 21, 13, 3, 2, ..."
If a reason exists why the opening sequence of numbers should start a new line, please move the picture to prevent the article from displaying in such a confusing, misleading way, realizing that the display is prone to change based on what device a reader uses and if the user tilts the device this way or that (and possibly also depending on what browser and zoom settings are in use).
Thanks. --173.67.42.107 (talk) 08:23, 29 May 2024 (UTC)
- The sequence is displayed on its own line for emphasis. For a better fix of your problem, I moved the image down. D.Lazard (talk) 08:59, 29 May 2024 (UTC)
Legibility
[edit]With this edit to the last example in section Fibonacci sequence#Fibonacci primes, for better legibility, I changed this:
into this:
User JayBeeEll reverted ([1]) with reason "I disagree that this increases legibility overall". Obviously I disagree with JBL's disagreement because I think that my version does a much better job at highlighting the primes. What do others think about this? - DVdm (talk) 17:37, 14 August 2024 (UTC)
- I don't really care either way. But we could instead highlight the primes in the more compact form by using color. —Quantling (talk | contribs) 20:38, 20 August 2024 (UTC)
- Yes, that's another way to make 'em stand out a bit more than they do now. - DVdm (talk) 21:02, 20 August 2024 (UTC)
- Thanks for starting a discussion here, sorry for my cryptic comment and for the delayed response. The substance of my objection is that making this vertical devotes a very large amount of space in the article to a very minor point, which seemed to me to distract from everything else. I would be happy with color as an alternative, or with a two-line array (say F_1 through F_9 on the first line, F_11 through F_15 on the second) that would allow one to easily pick out the factorization in the two composites. --JBL (talk) 00:36, 21 August 2024 (UTC)
- Good point. Let's go for the color then. I went ahead and colored the non-primes that could be factored, leaving 1 black: [2].
- Cheers! = DVdm (talk) 10:04, 21 August 2024 (UTC)
They don't all have closed forms
[edit]The article claims "Like every sequence defined by a linear recurrence with constant coefficients, the Fibonacci numbers have a closed-form expression", but this is not true. It is true for all linear recurrences of order 4 or lower, and for some special cases of higher orders. But it is certainly not true for all of them. Perhaps moderate that sentence a bit, or maybe even remove the claim entirely? (Keeping the link to linear recurrence with constant coefficients seems apt, though.) MasterHigure (talk) 20:18, 20 August 2024 (UTC)
- The definition of "closed-form expression" in the first sentence of the article Closed-form expression allows the use of "constants", in this case the roots of the characteristic polynomial. When the coefficients of the recurrence are rational, if the degree is larger than 4, these roots may not be expressible in terms of radicals; but that seems irrelevant. --JBL (talk) 20:27, 20 August 2024 (UTC)
- Perhaps relevant: a quintic equation (and likewise for higher degree) is not guaranteed to give a closed form for its roots. But if we are handed the roots, we could write down a closed form expression for the sequence. That is, there is a closed form expression for the sequence, it's just that generally we can't figure it out. —Quantling (talk | contribs) 20:34, 20 August 2024 (UTC)
- (edit conflict)
- This source
- Sarah-Marie Belcastro (2018). Discrete Mathematics with Ducks (2nd, illustrated ed.). CRC Press. p. 260. ISBN 978-1-351-68369-2. Extract of page 260
- says... ...there is an algorithm for finding a closed form for any linear homogenous recurrence relation with constant coefficients.
- SInce the Fibonacci expression is indeed homogenous, I have just added the word homogenous to the sentence and added the source. So we don't have to worry about the order. - DVdm (talk) 20:49, 20 August 2024 (UTC)