Fibbonacci series
int main() {
int f1 =0,f2=1,f;
for(int i=0;i<5;i++)
{
f = f1 +f2;
f1=f2;
f2=f;
printf("%d\t",f);
}
return 0;
}
int f1 =0,f2=1,f;
for(int i=0;i<5;i++)
{
f = f1 +f2;
f1=f2;
f2=f;
printf("%d\t",f);
}
return 0;
}
series of numbers when a sequence of prime numbers are added
int main() { int i,j,k=4; for(i=2;i<=13;i++) { for(j=2;j<=i;j++) { if(i%j==0) { break; } } if(i==j) { k= k+i; printf("%d ",k); } } return 0; } OUTPUT:
Comments
Post a Comment