Search results
Jump to navigation
Jump to search
Page title matches
- 5 KB (743 words) - 13:10, 27 July 2008
- 12 bytes (1 word) - 18:42, 21 December 2007
- 191 bytes (31 words) - 15:05, 3 July 2008
- 117 bytes (19 words) - 20:08, 27 January 2010
- 902 bytes (143 words) - 03:08, 16 October 2008
- ...and Weisstein, Eric W. "[http://mathworld.wolfram.com/FibonacciNumber.html Fibonacci Number.]" From MathWorld--A Wolfram Web Resource.164 bytes (20 words) - 21:13, 27 January 2010
Page text matches
- *[[Fibonacci number]]136 bytes (13 words) - 17:46, 17 February 2008
- The sequence of '''Lucas numbers''' is strongly related to the sequence of [[Fibonacci number]]s. Lucas number and Fibonacci numbers have the identical formula <math>a_n *Relationship to the [[Fibonacci number]] is given by <math>L_n = F_{n-1} + F_{n+1}\ </math>.798 bytes (117 words) - 04:00, 4 March 2008
- In [[mathematics]], '''Fibonacci polynomials''' are a generalization of [[Fibonacci number]]s. These [[polynomial]]s are defined by:694 bytes (111 words) - 17:51, 21 January 2008
- ...and Weisstein, Eric W. "[http://mathworld.wolfram.com/FibonacciNumber.html Fibonacci Number.]" From MathWorld--A Wolfram Web Resource.164 bytes (20 words) - 21:13, 27 January 2010
- {{r|Fibonacci number}} {{r|Fibonacci number}}566 bytes (73 words) - 16:56, 11 January 2010
- {{r|Fibonacci number}}395 bytes (45 words) - 07:44, 11 November 2009
- ...''Lucas sequence''' is a particular generalisation of sequences like the [[Fibonacci number|Fibonacci numbers]], [[Lucas number|Lucas numbers]], [[Pell number|Pell num4 KB (776 words) - 20:44, 20 February 2010
- {{r|Fibonacci number}}2 KB (262 words) - 19:07, 11 January 2010
- {{r|Fibonacci number}}613 bytes (77 words) - 19:56, 11 January 2010
- where <math>\ F_n</math> is the n-th term of the [[Fibonacci number|Fibonacci sequence]].4 KB (685 words) - 19:54, 1 November 2013
- The [[Fibonacci number]]s satisfy a recurrence relation in which each term depends on the two prec3 KB (462 words) - 15:50, 14 December 2008
- {{r|Fibonacci number}}3 KB (375 words) - 10:21, 31 July 2009
- ...year]]). This set contains many remarkable subsets : [[prime number]]s, [[Fibonacci number]]s, [[perfect number]]s, [[catalan number]]s, etc.11 KB (1,701 words) - 20:07, 1 July 2021
- ...ath>\ k=1,2,\dots,</math> where <math>\ F_{t}</math> are the [[Fibonacci number]]s, where where <math>\ F_r</math> is the r-th [[Fibonacci number]].35 KB (5,836 words) - 08:40, 15 March 2021
- ...nd in [[Probability theory|probabilities]]. We can use it to compute the [[Fibonacci number]]s and to create the [[Sierpinski triangle]]. After studying it, [[Isaac Ne ...was also realised that the shallow diagonals of the triangle sum to the [[Fibonacci number]]s. The Indian mathematician Bhattotpala (c. 1068) later gives rows 0-16 of32 KB (4,192 words) - 18:42, 3 March 2024