Question

In: Math

Consider the Fibonacci sequence 1,1,2,3,5,8,13,21,34,55,89,…. . The first two numbers are 1 and 1. When you...

Consider the Fibonacci sequence 1,1,2,3,5,8,13,21,34,55,89,…. . The first two numbers are 1 and 1. When you add these numbers you get 2 = 1+1, which becomes the third number in the sequence. When you add the second and third numbers, you get 3 = 1+2, which becomes the fourth number in the sequence. When you add the third and fourth numbers, you get 5 = 2+3, which becomes the fifth number in the sequence; and so on to generate the sequence. Write a short Excel program that generates the first 50 numbers of the Fibonacci sequence, using 1 and 1 as the first two numbers to start the sequence. Put these numbers in Column A in Excel. Also, in the next column in Excel (Column B), divide each number in the sequence by the previous number in the sequence. This column is a new sequence of numbers. Start Column B in Row 2. To what number does the sequence of the quotients in Column B converge? Use the 2-D Bar Chart tool in Excel to graph the first 10 ratios in Column B

Expert Solution

The excel images with correct steps are shown below.

Step 1: The first and second rows in column are filled with the value '1'.

Step 2: In the third row, the formula '' is applied (enter key is pressed).

Step 3: The third row/cell mentioned above is copeid (ctrl+c) and then the cells from 4th to 50th rows are selected, and then paste option is enforced (by ctrl+v), thereby providing us the first column.

Step 4: Cell in 2nd row and column B is selected, and formula '' is applied.

Step 5: By analogous procedure, the column B is created by copying its second row and pasting the formula until all the values in column are covered.

We now have the two two columns. The values may seem that they exactly (not according to charts, but to the numbers in sight) converges from (25-1) 24th term of of the second column, as can be seen in the image below, but the convergence actually starts from the 7th term in column B. It is after the 7th term there that the values lose their volatile (ie increasing and then decreasing and then again increasing, and so on) trend.

The bar chart is as below, which is created by selecting first 10 cells in column B, and then goind to Insert option, then chart, and then choosing Bar Chart in the option there.

milcah answered 1 year ago

The Fibonacci Sequence is a series of integers. The first two numbers in the sequence are...

The Fibonacci Sequence is a series of integers. The first two numbers in the sequence are both 1; after that, each number is the sum of the preceding two numbers. 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... For example, 1+1=2, 1+2=3, 2+3=5, 3+5=8, etc. The nth Fibonacci number is the nth number in this sequence, so for example fibonacci(1)=1, fibonacci(2)=1, fibonacci(3)=2, fibonacci(4)=3, etc. Do not use zero-based counting; fibonacci(4)is 3, not 5. Your assignment...

(a) The Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence,...

(a) The Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and are characterised by the fact that every number after the first two is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 114, … etc. By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. We define Fib(0)=0,...

Google the first 50 numbers of the Fibonacci sequence (starting with 1) to answer the following...

Google the first 50 numbers of the Fibonacci sequence (starting with 1) to answer the following questions: (a) Test to see if the leading digits conform to Benford’s law. Do this both graphically and analytically. (b) Using the first 10 odd numbers in the sequence as sample 1 and the first 10 even numbers in the sequence as sample 2, use Wilcoxon’s Rank-Sum to test the claim that the numbers come from different populations. (c) Repeat (b)...

Using C++ use dynamic programming to list first 30 Fibonacci numbers. Fibonacci sequence is famous problem...

Using C++ use dynamic programming to list first 30 Fibonacci numbers. Fibonacci sequence is famous problem solved with recursion. However, this can also be done more efficiently using dynamic programming. Create a program that uses dynamic programming techniques to list the first 30 Fibonacci numbers.

The Fibonacci sequence is an infinite sequence of numbers that have important consequences for theoretical mathematics...

The Fibonacci sequence is an infinite sequence of numbers that have important consequences for theoretical mathematics and applications to arrangement of flower petals, population growth of rabbits, and genetics. For each natural number n ≥ 1, the nth Fibonacci number fn is defined inductively by f1 = 1, f2 = 2, and fn+2 = fn+1 + fn (a) Compute the first 8 Fibonacci numbers f1, · · · , f8. (b) Show that for all natural numbers n, if α...

The Lucas Numbers are a sequence very similar to the Fibonacci Sequence, the only difference being...

The Lucas Numbers are a sequence very similar to the Fibonacci Sequence, the only difference being that the Lucas Numbers start with L0 = 2 and L1 = 1 as opposed to Fibonacci’s F0 = 0 and F1 = 1. Concretely, they are defined by L0 = 2, L1 = 1, and Ln := Ln−1 + Ln−2 for n > 1. Write a function in C++ that takes an integer argument N and returns the sum of the first N...

In this assignment, you will calculate and print a list of Fibonacci Numbers . Fibonacci numbers...

In this assignment, you will calculate and print a list of Fibonacci Numbers . Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones: The sequence Fn of Fibonacci numbers is defined by the recurrence relation: which says any Nth Fibonacci number is the sum of the (N-1) and (N-2)th Fibonacci numbers. Instructions Your task will be...

The Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5, 8,.... Formally,...

The Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5, 8,.... Formally, it can be expressed as: fib0 = 0 fib1 = 1 fibn = fibn-1 + fibn-2 Write a multithreaded C++ program that generates the Fibonacci series using the pthread library. This program should work as follows: The user will enter on the command line the number of Fibonacci numbers that the program will generate. The program will then create a separate thread that will...

. (a) Write a C++ program to find Fibonacci numbers. (For the definition of Fibonacci numbers...

. (a) Write a C++ program to find Fibonacci numbers. (For the definition of Fibonacci numbers and the recursive formula please refer to problem 5 of Chapter 2 at page 81 in the text-book.) The program asks the user to input an integer and outputs the corresponding Fibonacci number. For example, if the user inputs 4, the program outputs the fifth Fibonacci number, which is 3. Introduce two local variables in the recursion function (suppose we call it fib(n)), one...

how to find arithmetic sequence, geometric sequence, and fibonacci sequence on excel?