Study guides

Q: Explain how to find the terms of Fibonacci sequence?

Write your answer...

Submit

Related questions

They are: 10 and 16

The Fibonacci sequence adds the 2 previous terms to find the next one. For instance: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55... etc.

because you add the first 2 terms and the next tern was the the sum of the first 2 terms.

on December 9, 1833

This question is posed on ProjectEuler, it is for you to figure out the answer.

His treatise, Liber abaci (1202), contains the famous Fibonacci sequence.

Fibonacci found it interesting because he loved maths

I think Fibonacci wanted to find how many swirls or petals were on a flower ....... most of them are Fibonacci numbers....i think.... doin a projct......= )

In nautilus shells and you have 5 fingers and that is a Fibonacci number. Find a better answer, I'm running out of answers!

he didn't actually find it interesting, in fact he fell asleep straight after he found it .

its either 233 or 754

A recursive sequence uses previous numbers to find the next number in a sequence after the base case. The Fibonacci sequence is an example of such a sequence. The base numbers of the Fibonacci sequence are 0 and 1. After that base, you find the next number in the sequence by adding the two previous numbers. So, the Fibonacci sequence looks like so: 0, 1, 1, 2, 3, 5, 8.... So, the third number is found by adding the first and second numbers, 0 and 1. So the third number is 1. The fourth number is found by adding the second and third numbers, 1 and 1. So, the fourth number is 2. You can continue on this way forever.

He found it interesting because it modelled a problem that he was studying at the time.

Lots of places. If you count the leaves in a flower or factor each fibonacci number to the fibonacci number before it, artichokes, seeds, dragonflies, pianos, bones, phi, pascal's triangle and MUCH MUCH MORE!!!!!

The sequence 1, 1, 2, 3, 5, ..., is used in mathematical programming to find the interval containing the minimizer of a function of one variable. Fibonacci was the founder of the Fibonacci Sequence, in which each number is found by adding together the two before it. The first few numbers are: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144...

The Fibonacci sequence can be used to determine the golden ratio. If you divide a term in the sequence by its predecessor, at suitably high values, it approaches the golden ratio.

It all depends on the sequence you are talking about. For example, the next number in the sequence 0,1,1,2,3,5,8,13,_ would be 21. This would be the Fibonacci sequence as the rule is add the 2 previous terms to get the next term. Another example would be this: 11,121,1331,14641,______.The missing number is 161051, following the pattern of powers of 11, 11^1, 11^2, 11^3 and so on. If you understand what I am trying to say, it all depends on the sequence you are trying to find the number in.

what? Assuming you wanted an algorithm to find the nth number in the Fibonacci sequence: double Fib(int i) { double x = 1; double y = 1; if (i

Start with the numbers 1 and 1. After that, every number in the sequence is the sum of the previous two numbers. Thus, the sequence starts with: 1, 1, 2, 3, 5, 8, 13, ...

you must find the pattern of the sequence in order to find the next 50 terms using that pattern and the first part of the sequence given

An arithmetic sequence.

yup

It is 4374

A quadratic sequence is when the difference between two terms changes each step. To find the formula for a quadratic sequence, one must first find the difference between the consecutive terms. Then a second difference must be found by finding the difference between the first consecutive differences.

Three or more terms of a sequence are needed in order to find its nth term.