Difference between revisions of "Fibonacci sequence"
m (+ problem) |
m |
||
Line 1: | Line 1: | ||
− | The '''Fibonacci sequence''' is a [[sequence]] of [[integer]]s in which the first and second term are both equal to 1, and each subsequent term is the sum of the two preceding it. Often, there is a zero-th term added in equal to 0. The first few terms are <br><math> | + | {{WotWAnnounce|week=Dec 6-12}} |
+ | |||
+ | The '''Fibonacci sequence''' is a [[sequence]] of [[integer]]s in which the first and second term are both equal to 1, and each subsequent term is the sum of the two preceding it. Often, there is a zero-th term added in equal to 0. The first few terms are <br><math>0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,...</math>. | ||
The Fibonacci sequence can be written [[recursion|recursively]] as <math>F_n=F_{n-1}+F_{n-2}</math>. There is also an explicit definition [[#Binet's formula|below]]. | The Fibonacci sequence can be written [[recursion|recursively]] as <math>F_n=F_{n-1}+F_{n-2}</math>. There is also an explicit definition [[#Binet's formula|below]]. | ||
Line 20: | Line 22: | ||
# A [[fair]] coin is to be tossed <math>10_{}^{}</math> times. Let <math>i/j^{}_{}</math>, in lowest terms, be the [[probability]] that heads never occur on consecutive tosses. Find <math>i+j_{}^{}</math>. <div style="text-align:right">([[1990 AIME Problems/Problem 9|1990 AIME, Problem 9]])</div> | # A [[fair]] coin is to be tossed <math>10_{}^{}</math> times. Let <math>i/j^{}_{}</math>, in lowest terms, be the [[probability]] that heads never occur on consecutive tosses. Find <math>i+j_{}^{}</math>. <div style="text-align:right">([[1990 AIME Problems/Problem 9|1990 AIME, Problem 9]])</div> | ||
=== Olympiad === | === Olympiad === | ||
− | # Determine the maximum value of <math> | + | # Determine the maximum value of <math>m^2 + n^2 </math>, where <math>m </math> and <math>n </math> are integers satisfying <math> m, n \in \{ 1,2, \ldots , 1981 \} </math> and <math>( n^2 - mn - m^2 )^2 = 1 </math>. <div style="text-align:right">([[1981 IMO Problems/Problem 3|1981 IMO, Problem 3]])</div> |
==See also== | ==See also== |
Revision as of 13:11, 6 December 2007
This is an AoPSWiki Word of the Week for Dec 6-12 |
The Fibonacci sequence is a sequence of integers in which the first and second term are both equal to 1, and each subsequent term is the sum of the two preceding it. Often, there is a zero-th term added in equal to 0. The first few terms are
.
The Fibonacci sequence can be written recursively as . There is also an explicit definition below.
Contents
Phi
Ratios between successive terms, , , , , , tend towards the limit phi.
Binet's formula
Binet's formula is an explicit formula used to find any nth term. It is .
Problems
Introductory
- The Fibonacci sequence starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci sequence?
Intermediate
- Seven line segments, with lengths no greater than 10 inches, and no shorter than 1 inch, are given. Show that one can choose three of them to represent the sides of a triangle. (Manhattan Mathematical Olympiad 2004)
- Except for the first two terms, each term of the sequence is obtained by subtracting the preceding term from the one before that. The last term of the sequence is the first negative term encounted. What positive integer produces a sequence of maximum length?
- A fair coin is to be tossed times. Let , in lowest terms, be the probability that heads never occur on consecutive tosses. Find .
Olympiad
- Determine the maximum value of , where and are integers satisfying and .
See also
This article is a stub. Help us out by expanding it.