answersLogoWhite

0

[ Fibonacci series___: ]

#include<stdio.h>

int main(void)

{

int n,i,c,a=0,b=1;

printf("Enter Fibonacci series of nth term : ");

scanf("%d",&n);

printf("%d %d ",a,b);

for(i=0;i<=(n-3);i++)

{

c=a+b;

a=b;

b=c;

printf("%d ",c);

}

}

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is the largest prime no that is stored in 8 bit pattern?

Write your own prime number program and find out.


How can I write a program to display prime numbers from 1 to 100?

Write a function that implements an algorithm that checks to see if a particular integer is prime (returning a boolean). Write a program that uses that function on each number from 1 to 100, and if true, displays that number.


Write a java program to display the number is prime or not?

Simply use a for loop (i) that runs from 2 to N-1. Checking if N % i 0 then its a prime number.


Write a c program to find given number is prime or not?

Yes, do write, or if you're too lazy to your homework, use google.


How to write number in ga language?

How to write number in ghanaian language


How do you write a number as a product of its prime factors?

write the number 14as a product of prime factor?


Is 3185 a prime number?

Write 3185 as a prime number


Write a programme for substraction of two numbers in c language?

substracion of any two number program in c


Write a program using 8086 instructions to double a number?

There isn't a reason to write a complete program to do this; in any assembly language just shift the value 1 bit to the left to double it.


How do you write a c program to get a range from user and give a list of prime numbers?

To get all tutorials of "c programming" Reference:cprogramming-bd.com/c_page2.aspx# prime number


Write Client and server program in C language using UDP?

Write and run a client and a server program in C-language using UDP


With a given big integer number which is the product of two prime numbers how do you find them?

First write a program to generate the prime number. After one prime number was generated, divide the big int number by the prime number. If the remainder is zero then quotient is the second prime number ( also it is important to check whether the quotient is prime number or not because sometimes you will get wrong answer). Repeat the process until you get the result.