Posted by menebr on Tuesday, June 23, 2009 at 8:05am.
This is not an understandable question.
Please put the name of the subject - math, science, biology, etc. Plus what specific question are you asking.
Assistance needed.
Perhaps you mean series and not serious? Try here:
http://www.google.com/search?hl=en&client=firefox-a&rls=org.mozilla:en-US:official&hs=igQ&ei=cdJASuOmJInWMIDm-csI&sa=X&oi=spell&resnum=0&ct=result&cd=1&q=fibonacci+series+flow+chart&spell=1
Sra
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.
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.