topic badge
CanadaON
Grade 11

Fibonacci Sequence

Interactive practice questions

Consider the following sequence.

$1,2,4,6,8,10,\text{. . .}$1,2,4,6,8,10,. . .

Is the sequence a Fibonacci-type sequence (where each term is the sum of the two preceding terms)?

Yes

A

No

B
Easy
< 1min

Consider the following sequence.

$2,-1,1,0,1,1,\text{. . .}$2,1,1,0,1,1,. . .

Easy
< 1min

Consider the following sequence.

$\pi,\pi,2\pi,3\pi,5\pi,8\pi,\text{. . .}$π,π,2π,3π,5π,8π,. . .

Easy
< 1min

Use the fact that the Fibonacci sequence is defined by $t_n=t_{n-2}+t_{n-1}$tn=tn2+tn1, where $t_1=1$t1=1 and $t_2=1$t2=1, to generate terms $3$3 to $8$8.

Write all the values on the same line, separated by commas.

Easy
1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

11U.C.1.5

Determine, through investigation, recursive patterns in the Fibonacci sequence, in related sequences, and in Pascal’s triangle, and represent the patterns in a variety of ways

What is Mathspace

About Mathspace