Question

In: Statistics and Probability

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 a t - Test.

Solutions

Expert Solution

Fibonacci sequence is a sequence of numbers in which each m]number (Fibonacci number) is the sum of the two preceding numbers.

First 25 numbers of the Fibonacci sequence are:

1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,1094617711,28657,46368,75025.

r-code for creating Fibonacci series is given by,

x=c(1,1) ## Required series
length(x)=50 ##Required length
for(i in 3:50)
{
x[i]=x[i-1]+x[i-2]
}
x

b)

Here our hypothesis is

H0: Numbers comes from the same population Vs

H1: Numbers comes from different population.

r-code and output:

> sam1=c(1,1,3,5,13,21,55,89,233,377)

> sam2=c(2,8,34,144,610,2584,10946,46368,196418,832040)

> wilcox.test(sam1,sam2)

Wilcoxon rank sum test with continuity correction

data: sam1 and sam2

W = 20, p-value = 0.02569

alternative hypothesis: true location shift is not equal to 0

Here p-value is 0.0256 which is less that 0.05.(at 5% L.O.S.). Hence we reject H0.Which implies that numbers comes from the different population.

c)

r-code and output:

> t.test(sam1,sam2)

Welch Two Sample t-test

data: sam1 and sam2

t = -1.3171, df = 9, p-value = 0.2203

alternative hypothesis: true difference in means is not equal to 0

95 percent confidence interval:

-295761.81 78090.61

sample estimates:

mean of x mean of y

79.8 108915.4

By using t-test, p-value is 0.22 which is geater that 0.05. Hence at 5% level of significance, we accept H0. Which means numbers come from the same population.


Related Solutions

(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,...
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...
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 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...
Find the first five terms of the following sequence, starting with n=1. an=−4n−3 Give your answer...
Find the first five terms of the following sequence, starting with n=1. an=−4n−3 Give your answer as a list, separated by commas. For example, if an=n, you would give your answer as 1,2,3,4,5.
Python: Using Jupyter Notebook 1. Write code to generate Fibonacci series. Fibonacci numbers – 1, 1,...
Python: Using Jupyter Notebook 1. Write code to generate Fibonacci series. Fibonacci numbers – 1, 1, 2, 3, 5, 8, … 2. Check if a number is an Armstrong number A positive integer is called an Armstrong number of order n if abcd... = a^n + b^n + c^n + d^n + ... In case of an Armstrong number of 3 digits, the sum of cubes of each digits is equal to the number itself. For example: 153 = 1*1*1...
For the Fibonacci sequence, f0 = f1 = 1 and fn+1 = fn + fn−1 for...
For the Fibonacci sequence, f0 = f1 = 1 and fn+1 = fn + fn−1 for all n > 1. Prove using induction: fn+1fn−1 − f2n = (−1)n.
The Fibonacci sequence is defined as F_1 = 1, F_2 = 1, and F_n = F_n-1...
The Fibonacci sequence is defined as F_1 = 1, F_2 = 1, and F_n = F_n-1 + F_n-2 for n >= 3. Calculate the sum F_1 + F_2 + ... + F_n using the fundamental theorem of summation.  
The Fibonacci numbers are recursively dened by F1 = 1; F2 = 1 and for n...
The Fibonacci numbers are recursively dened by F1 = 1; F2 = 1 and for n > 1; F_(n+1) = F_n + F_(n-1): So the rst few Fibonacci Numbers are: 1; 1; 2; 3; 5; 8; 13; 21; 34; 55; 89; 144; : : : There are numerous properties of the Fibonacci numbers. a) Use the principle of Strong Induction to show that all integers n > 1 and m > 0 F_(n-1)F_(m )+ F_(n)F_(m+1) = F_(n+m): Solution. (Hint: Use...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT