Asked by menebr
construct flow chart for generating the nth fibonacci serious using two seed numbers read from the user input two seed number lengthe of the fibonacci serious
Answers
Answered by
GuruBlue
This is not an understandable question.
Please put the name of the subject - math, science, biology, etc. Plus what specific question are you asking.
Please put the name of the subject - math, science, biology, etc. Plus what specific question are you asking.
Answered by
Writeacher
Assistance needed.
Answered by
Reiny
Looks like you are after the famous
Fibonacci series (not serious).
This is one of the best websites I know dealing with that wonderful topic
http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
If we define the nth Fibonacci number as
Fib(n), then you could start with
Fib(1) = 1, Fib(2) = 1 or enter those values as input
then starting with n=3, have a line in your program that looks something like
Fib(n) = Fib(n-1) + Fib(n-2)
increase n by 1 and go back to the above statement.
Like GuruBlue, I have difficulty understanding your posting.
Fibonacci series (not serious).
This is one of the best websites I know dealing with that wonderful topic
http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
If we define the nth Fibonacci number as
Fib(n), then you could start with
Fib(1) = 1, Fib(2) = 1 or enter those values as input
then starting with n=3, have a line in your program that looks something like
Fib(n) = Fib(n-1) + Fib(n-2)
increase n by 1 and go back to the above statement.
Like GuruBlue, I have difficulty understanding your posting.
Answered by
MathMate
To get you started, I can give you a pseudocode.
Input: seed1, seed2;
Input: length;
for(n=0; n<length; n+=1)
{
nextNumber=seed1+seed2;
Print: nextNumber;
seed1=seed2;
seed2=nextNumber;
}
Stop:
However, please note that there is no simple way to verify that the two given seed numbers are members of the Fibonaccu set of numbers, unless we start the verification from the beginning.
Input: seed1, seed2;
Input: length;
for(n=0; n<length; n+=1)
{
nextNumber=seed1+seed2;
Print: nextNumber;
seed1=seed2;
seed2=nextNumber;
}
Stop:
However, please note that there is no simple way to verify that the two given seed numbers are members of the Fibonaccu set of numbers, unless we start the verification from the beginning.
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.