[ 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);
}
}
Write your own prime number program and find out.
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.
Simply use a for loop (i) that runs from 2 to N-1. Checking if N % i 0 then its a prime number.
Yes, do write, or if you're too lazy to your homework, use google.
How to write number in ghanaian language
write the number 14as a product of prime factor?
Write 3185 as a prime number
substracion of any two number program in c
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.
To get all tutorials of "c programming" Reference:cprogramming-bd.com/c_page2.aspx# prime number
Write and run a client and a server program in C-language using UDP
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.