#include <iostream>
using std::cout;
using std::endl;
int main() {
int i = 0;
int j = 1;
int k;
cout << i << ' ' << j << ' ';
while (i + j <= 10000) {
k = i + j;
cout << k << ' ';
i = j;
j = k;
}
cout << endl;
return 0;
}
What is the assembly program to generate a geometric series and compute its sum The inputs are the base root and the length of the series The outputs are the series elements and their sum?
Exactly what do you mean by 'C program in Java'
You mean you have written a program, but you don't understand it? Well, how could I explain it without seeing it?
i dn't know. haha
20 is not a term in the Fibonacci series.
Yes, this can be done. For example for Fibonacci series. You will find plenty of examples if you google for the types of series you need to be generated.
Fibonacci!
As you expand the Fibonacci series, each new value in proportion to the previous approaches the Golden Ratio.
The golden ratio is approximately 1.618: 1. This ratio is commonly found in nature and architecture. Stock traders often look for this ratio in patterns on stock charts. One way to compute this ratio is to compare any adjacent Fibonacci numbers. For this reason stock traders often refer to this type of analysis using the term Fibonacci, as in "Fibonacci retracements".
132134...
Series
It is 354224848179261915075.