Fibonacci numbers: Difference between revisions

Fibonacci numbers (edit)

Revision as of 18:52, 12 July 2021

117 bytes removed , 12 July 2021

no edit summary

Aardvark

Bureaucrats, Interface administrators, Suppressors, Administrators, Widget editors

6,489

edits

@@ Line 3: / Line 3: @@
 </div>
-In mathematics, the '''Fibonacci numbers''', commonly denoted <math>F_n</math>, form a sequence, called the '''Fibonacci sequence''', such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,
+In mathematics, the '''Fibonacci numbers''', commonly denoted \(F_n\), form a sequence, called the '''Fibonacci sequence''', such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,
-:<math>F_0=0,\quad F_1= 1,</math>
+:\(F_0=0,\quad F_1= 1,\)
 and
-:<math>F_n=F_{n-1} + F_{n-2},</math>
+:\(F_n=F_{n-1} + F_{n-2},\)
-for <math>n > 1</math>.
+for \(n > 1\).
 The beginning of the sequence is thus:
-:<math>0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\; \ldots</math>
+:$$0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\; \ldots$$
 Fibonacci numbers are named after Italian mathematician Leonardo of Pisa, later known as Fibonacci. In his 1202 book Liber Abaci, Fibonacci introduced the sequence to Western European mathematics, although the sequence had been described earlier in Indian mathematics as early as 200 BC in work by Pingala on enumerating possible patterns of Sanskrit poetry formed from syllables of two lengths.
 ==Mathematics==
-The ratio <math> \frac {F_n}{F_{n+1}} \ </math> approaches the [[golden ratio]] as <math>n</math> approaches infinity.
+The ratio \( \frac {F_n}{F_{n+1}} \ \) approaches the [[golden ratio]] as \(n\) approaches infinity.
 [[File:PascalTriangleFibanacci.png|thumb|right|360px|The Fibonacci numbers are the sums of the "shallow" diagonals (shown in red) of [[Pascal's triangle]].]]
 The Fibonacci numbers occur in the sums of "shallow" diagonals in [[Pascal's triangle]].
-:<math>F_n = \sum_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor} \binom{n-k-1}{k}</math>
+:$$F_n = \sum_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor} \binom{n-k-1}{k}$$
-Counting the number of ways of writing a given number <math>n</math> as an ordered sum of 1s and 2s (called [[Composition (combinatorics)|compositions]]); there are <math>F_{n+1}</math> ways to do this.  For example, if <math>n = 5</math>, then <math>F_{n+1} = F_{6} = 8</math> counts the eight compositions summing to 5:
+Counting the number of ways of writing a given number \(n\) as an ordered sum of 1s and 2s (called [[Composition (combinatorics)|compositions]]); there are \(F_{n+1}\) ways to do this.  For example, if \(n = 5\), then \(F_{n+1} = F_{6} = 8\) counts the eight compositions summing to 5:
-<math>1+1+1+1+1 = 1+1+1+2 = 1+1+2+1 = 1+2+1+1 = 2+1+1+1 = 2+2+1 = 2+1+2 = 1+2+2</math>
+$$1+1+1+1+1 = 1+1+1+2 = 1+1+2+1 = 1+2+1+1 = 2+1+1+1 = 2+2+1 = 2+1+2 = 1+2+2$$
 == Resources: ==