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
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.
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.
To construct a flowchart for generating the nth Fibonacci series using two seed numbers (read from user input) and the length of the Fibonacci series, follow these steps:
1. Start the flowchart with an input symbol to read the first seed number, "a", from the user.
2. Add another input symbol to read the second seed number, "b", from the user.
3. Use an input symbol to read the desired length of the Fibonacci series, "length", from the user.
4. Initialize a counter, "count", to 2 as the first two numbers (the seed numbers) are already known.
5. Add a process symbol to output the first seed number, "a".
6. Add another process symbol to output the second seed number, "b".
7. Use a decision symbol to check if the length of the series is less than or equal to 2. If true, go to step 12.
8. If the length is larger than 2, add a process symbol to calculate the next Fibonacci number, "c", using the formula c = a + b.
9. Output the value of "c" using a process symbol.
10. Update the seed numbers: set "a" equal to "b", and "b" equal to "c".
11. Increment the counter, "count", by 1.
12. Check if the counter is equal to the desired length of the series. If true, go to step 15.
13. If the counter is not equal to the length, go back to step 8.
14. Add an output symbol to signify the end of the flowchart.
15. End the flowchart.
Note: To visualize the flowchart, you can use online flowchart creation tools or software such as Microsoft Visio, Lucidchart, or draw.io.