The nth Fibonacci number F, is defined as follows:Fo = 1, F1 = 1,andF = Fn-1 + Fn-2 for n> 1In other words, each number is the sum of the two previous numbers in the sequence. Thus, thefirst several Fibonacci numbers are 1, 1, 2, 3, 5, and 8. Interestingly, certain population growthrates are characterized by the Fibonacci numbers. If a population has no deaths, then the seriesgives the size of the population after each time period.Assume that a population of green crud grows at a rate described by the Fibonacci numbers andhas a time period of 5 days. Hence, if a green crud population starts out as 10 pounds of crud,then after 5 days, there is still 10 pounds of crud; in 10 days, there is 20 pounds of crud; in 15days, 30 pounds of crud; in 20 days, 50 pounds of crud, and so on.Write a program that takes both the initial size of a green crud population (in pounds) and somenumber of days as input from the keyboard, and computes from that information the size of thepopulation (in pounds) after the specified number of days. Assume that the population size is thesame for four days and then increases every fifth day. The program must allow the user to repeatthis calculation as long as desired. Please note that zero is a valid number of days for the crud togrow in which case it would remain at its initial value.Your output should look something like:CWindowslaystemiemdeeease enter the initial size of the green crud: nom sorry that, value is unrecognized or is negat ivelease enter the initial size of the green crud: -3m sorry that value is unrecognized or is negativePlease ențter the initialPlease enter the number of gyà 6ounds of crud growing for 20 days.Hith an initial population ofthe finalHould you like to cont iam sorryşize of the green crud: 10populat ion would bepoundstinue? (y/n)why?thatanswer is notenterinitialenter the number of days: 0theşizeofgreen crud: 10Hith an initial population of 10 pounds of crud growing for 0 days.the final population would be 10 poundsNould you ike to continue? (y/n)nPress any key to cont inue . ..

and F = Fn-1 + Fn-2 for n> 1 In other words, each number is the sum of the two previous numbers in first several Fibonacci numbers are 1, 1, 2, 3, 5, and 8. Interestingly, cer rates are characterized by the Fibonacci numbers. If a population has no gives the size of the population after each time period.

and F = Fn-1 + Fn-2 for n> 1 In other words, each number is the sum of the two previous numbers in first several Fibonacci numbers are 1, 1, 2, 3, 5, and 8. Interestingly, cer rates are characterized by the Fibonacci numbers. If a population has no gives the size of the population after each time period.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Suppose that there are N events to be held this year. The ith event is scheduled from day si to day…

A: Here we are initializing a list for sorting the dates , then obtaining each si and ti through map…

Q: sum = 0; for (int i = 1; i< n; i = sum++ || 2*i)

A: BELOW STEP BY STEP COMPLETE SOLUTION REGARDING YOUR PROBLEM :

Q: Overflows You have learned the concept of overflow (with say n! that overflows at 13! for integer)…

A: In fibonacci series next number is the sum of previous two numbers.

Q: Sum of Squared Errors: Remember from your statistics courses that if two random variables X and Y…

A: Here is the python code of above problem. See below step for code.

Q: Let p(n) = Σa;n², i=0 where ad > 0, be a degree-d polynomial in n, and let k be a constant. Use the…

A: SOLUTION - We need to find for, If K > d, then p(n) = o(n)k

Q: The search algorithm developed will be used for users to search the catalog for all items matching…

A: Let us first see what exactly is happening here. Assume that you are searching for something on a…

Q: Consider the problem of making change for n cents using the fewest number of coins. Assume that we…

A: Recursive Backtracking Algorithm: Function CoinChange(n, coins) return CoinChangeRecursive(n,…

Q: 5. Define the following (almost Fibonacci) recurrence for n = 0 Gn for n = 1 Gn-1+Gn-2+1 for n2 2…

A: Hey there, I am writing the required solution of the questin mentioned above. Please do find the…

Q: Let pn(x) be the probability of selling the house to the highest bidder when there are n people, and…

A: Let pn(x) be the probability of selling the house to the highest bidder when there are n people, and…

Q: order Spada numbers are well established in the insurance industry. Formally they are defined by the…

A: It is defined as simply a series of instructions that are followed, step by step, to do something…

Q: Consider the problem of making change for n cents using the fewest number of coins. Assume that we…

A: Instead of starting with the larger problem and breaking it down into smaller subproblems…

Q: or n=5 , In base there are more than 5 stars, however it should be equal to 5 like I shared picture…

A: In this question we have to write a python program for the hollow triangle with a same number of all…

Q: Given a deck of 52 playing cards, we place all cards in random order face up next to each other.…

Q: Suppose that an algorithm has runtime 20 n3 for n 100, the slowest cases for each n take time 2 n2…

A: The question is on: finding worst-case runtime and average case runtime of the given algorithm.

Q: Consider the same house rent prediction problem where you are supposed to predict price of a house…

A: The solution to the above question is:

Q: random variables X and Y are related by a relation YaX+b and you had a set of observations (1.1),…

A: the python code is an given below :

Q: Asymptotic notation Prove each of the following. You can use either the definitions of the form…

A: Answer: Our instruction is answer the first three part from the first part and I have given answered…

Question

The nth Fibonacci number F, is defined as follows:
Fo = 1, F1 = 1,
and
F = Fn-1 + Fn-2 for n> 1
In other words, each number is the sum of the two previous numbers in the sequence. Thus, the
first several Fibonacci numbers are 1, 1, 2, 3, 5, and 8. Interestingly, certain population growth
rates are characterized by the Fibonacci numbers. If a population has no deaths, then the series
gives the size of the population after each time period.
Assume that a population of green crud grows at a rate described by the Fibonacci numbers and
has a time period of 5 days. Hence, if a green crud population starts out as 10 pounds of crud,
then after 5 days, there is still 10 pounds of crud; in 10 days, there is 20 pounds of crud; in 15
days, 30 pounds of crud; in 20 days, 50 pounds of crud, and so on.
Write a program that takes both the initial size of a green crud population (in pounds) and some
number of days as input from the keyboard, and computes from that information the size of the
population (in pounds) after the specified number of days. Assume that the population size is the
same for four days and then increases every fifth day. The program must allow the user to repeat
this calculation as long as desired. Please note that zero is a valid number of days for the crud to
grow in which case it would remain at its initial value.
Your output should look something like:
CWindowslaystemiemdee
ease enter the initial size of the green crud: no
m sorry that, value is unrecognized or is negat ive
lease enter the initial size of the green crud: -3
m sorry that value is unrecognized or is negative
Please ențter the initial
Please enter the number of gyà 6ounds of crud growing for 20 days.
Hith an initial population of
the final
Hould you like to cont i
am sorry
şize of the green crud: 10
populat ion would be
pounds
tinue? (y/n)why?
that
answer is not
enter
initial
enter the number of days: 0
the
şize
of
green crud: 10
Hith an initial population of 10 pounds of crud growing for 0 days.
the final population would be 10 pounds
Nould you ike to continue? (y/n)n
Press any key to cont inue . ..

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

Please answer it asap. both questions.
Wilson's Theorem states that for any natural number n > 1, n is prime if and only if Python (n – 1)! = -1 (mod n) Write a function wilson (n) that accepts a natural number n, and returns the remainder of (n – 1)! + 1 after division by n.
Pick one million sets of 12 uniform random numbers between 0 and 1. Sum up the 12 numbers in each set. Make a histogram with these one million sums, picking some reasonable binning. You will find that the mean is (obviously?) 12 times 0.5 = 6. Perhaps more surprising, you will find that the distribution of these sums looks very much Gaussian (a "Bell Curve"). This is an example of the "Central Limit Theorem", which says that the distribution of the sum of many random variables approaches the Gaussian distribution even when the individual variables are not gaussianly distributed. mean Superimpose on the histogram an appropriately normalized Gaussian distribution of 6 and standard deviation o = 1. (Look at the solutions from the week 5 discussion session for some help, if you need it). You will find that this Gaussian works pretty well. Not for credit but for thinking: why o = 1 in this case? (An explanation will come once the solutions are posted).
The factorial function f(n) = n! is defined by n! = 1 2 3... n whenever n is a positive integer, and O! = 1. Provide big-O estimates for the factorial function and the logarithm of the factorial function. As an illustration, 1! = 1, 2! = 1 2=2, 3! = 1 23 = 6, and 4! = 1 234=24.Take note of how quickly the function n! expands. Consider the following: 20! = 2,432,902,008,176,640,000.
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…
In Fibonacci's model, rabbits live forever. The following modification of Definition 3.1 accounts for if n ≤ 0 if n = 1 or n = 2 G(n) = 1 (a) Compute G(n) for n = 1, 2, ..., 12. G(1) G(2) G(3) G(4) G(5) G(6) G(7) G(8) G(9) G(10) G(11) G(12) = = = = = = = = G(n-1) + G(n − 2) - G(n - 8) if n > 2. - = (b) In this modified model, how long do rabbits live? months
Find f(1), f(2), f(3), f(4), and f(5) if f(n) is defined re-cursively by f(0) = 3 and for n = 0, 1, 2, ... a) f(n + 1) = −2f(n).b) f(n + 1) = 3f(n) + 7.
We have that y*n+1=y*n=y*. Using the given model: yn+1 = byn(1-yn), we find that y* = 1-1/b and y* = 0 are fixed points. I have the function:def main(b,yInit,n): out=np.zeros((n,1)) y = yInit for i in range(n): out[i] = y y = b*(1-y)*y return out The graph model of this would depend both on the value of the initial population (y*) and choice of b. I need to graph this in python using interactive sliders widget [from matplotlib.widgets import slider], where one slider will control b value (x-axis) and another for y value (y-axis). I have the skeleton code for the sliders but have no idea how to graph this equation with it. (y* = between 0 to 1, b = 0 to 4)