Talk:Fibonacci sequence: Difference between revisions

Revision as of 10:32, 18 July 2025

Latest revision as of 21:13, 18 July 2025

(One intermediate revision by one other user not shown)

Line 109:

:I don't understand your question about the generating function. As for your other point, the article has a diagram and the line 'The Fibonacci numbers occur as the sums of binomial coefficients in the "shallow" diagonals of Pascal's triangle'. –[[user:jacobolus|jacobolus]] [[user_talk:jacobolus|(t)]] 10:03, 18 July 2025 (UTC)

:I have added the standard way for computing the generating series. [[User:D.Lazard|D.Lazard]] ([[User talk:D.Lazard|talk]]) 10:32, 18 July 2025 (UTC)

::I edited the article before seeing this discussion. I apologize for that. Hopefully, the edit I made will be considered constructive nonetheless. If not, please revert or otherwise do the right thing. Thank you —[[User:Quantling|<span class="texhtml"><i>Q</i></span>uantling]]&nbsp;([[User talk:Quantling|talk]]&nbsp;&#124;&nbsp;[[Special:Contributions/Quantling|contribs]]) 13:16, 18 July 2025 (UTC)

:::I removed the section since its understandable part contains only assertions that are elsewhere in the article. Flajolet et al. systematic use of generating series (even when they are never convergent) is interesting and very powerful, but I do not se any reason for mentioning it in this article. [[User:D.Lazard|D.Lazard]] ([[User talk:D.Lazard|talk]]) 21:13, 18 July 2025 (UTC)