#include
#include
void main(void)
{
int i,j,k,n;
clrscr();
i=0;
j=1;
printf("%d %d ",i,j);
for(n=0;n<=5;n++)
{
k=i+j;
i=j;
j=k;
printf("%d ",k);
}
getch();
}
write a program for Fibonacci series by using cunstructer ti initilised the value
Just generate the Fibonacci numbers one by one, and print each number's last digit ie number%10.
You mean you have written a program, but you don't understand it? Well, how could I explain it without seeing it?
public static int fib(int n) {return fib(n-1) + fib(n-2);}
//WAP to print fibonacci series using do-while loop.? using System; class Fibonacci { public static void Main() { int a=1,b=1; int sum=0; Console.Write("Enter Limit:"); int n=Int32.Parse(Console.ReadLine()); Console.Write(a); Console.Write(b); do { sum=a+b; a=b; b=sum; Console.Write(sum); } while(sum<n); } } By-Vivek Kumar Keshari
#include<stdio.h> #include<conio.h> int fib(int a); main() { int a; clrscr(); scanf("%d",&a); for(int i=0;i<a;i++) printf("%d\n",fib(i)); } int fib(int a) { if(a==0) return 0; if(a==1) return 1; else return (fib(a-1)+fib(a-2)); }
i dn't know. haha
subtract the smallest one
#include #include void main() { clrscr() int a=0,b=1,c,i,n; coutn cout
Exactly what do you mean by 'C program in Java'
Just generate the Fibonacci numbers one by one, and print each number's last digit ie number%10.
//to generate Fibonacci series upto a range of 200....(in C).... #include<stdio.h> main() { int a,b,c,i; a=0; b=1; printf("\n FIBONACCI SERIES .....\t"); i=1; while(i<=(200-2)) { c=a+b; printf("\t%d",c); a=b; b=c; i++; } }
You mean you have written a program, but you don't understand it? Well, how could I explain it without seeing it?
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?
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.