bole seniour school

posted by .

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

  • Needs subject -

    This is not an understandable question.
    Please put the name of the subject - math, science, biology, etc. Plus what specific question are you asking.

  • Math -

    Assistance needed.

  • bole seniour school -

    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

  • bole seniour school -

    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.

  • programming -

    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.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. math

    There is no function equation for the Fibonacci numbers, you have to use a Recursion formula. F(n) = F(n-1) + F(n-2) for n>2 and F(1)=1, F(2)=1 what is the equation for the fibonacci sequence
  2. English

    1. There were two seeds. The first seed was negative, but the second seed was positive. 2. There were two seeds. One seed was negative, but the other seed was positive. 3. There were two seeds. The first seed was negative, but the …
  3. Math

    F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci sequence. Find F27. I do not understand the Fibonacci sequence, could someone help me with my question and explain it to me please.
  4. Computer Science - MATLAB

    One interesting property of a Fibonacci sequence is that the ratio of the values of adjacent members of the sequence approach a number called “the golden ratio” or PHI. Create a program that accepts the first two numbers of a Fibonacci …
  5. Computer Science - MATLAB

    I guess it was skipped One interesting property of a Fibonacci sequence is that the ratio of the values of adjacent members of the sequence approach a number called “the golden ratio” or PHI. Create a program that accepts the first …
  6. Pre-Calc

    Find three examples of the Fibonacci sequence in nature. Write a paragraph for each example. For each example, address the following questions: How does the example relate to the Fibonacci sequence?
  7. Fibonacci numbers

    I have three problems to answer dealing with Fibonacci numbers. I understand the first two, but would like for reassurrance that they are correct and lost on the last one and could use some help. Thank you. 1. Fibonacci numbers can …
  8. Math (fibonacci

    A sequence of numbers is called a Fibonacci-type sequence if each number (after for the first two) is the sum of the two numbers which precede it. For example, 1, 1, 2, 3, 5, 8 ... is a Fibonacci- type sequence. If 1985, x, y, 200 …
  9. Maths

    A super-Fibonacci sequence is a list of whole numbers with the property that, from the third term onwards, every term is the sum of all the previous terms. For example, 1, 4, 5, 10, ... How many super-Fibonacci sequences with 1 involve …
  10. Maths

    The Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, ... starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci …

More Similar Questions