Skip to main content

Checking whether a number is Fibonacci.

PROCEDURE:-
    1.enter an integer value
    2. set a=0,b=1,c=a+b,flag=0
    3.repeat steps 4 ,5 until c is less than or equal to n
    4.if n and c are same print that n is Fibonacci number
    5.else set a=b,b=c, c=a+b
    6 if n is not equal to c it is not Fibonacci number 
CODE:-

#include<stdio.h>
void main()
{
int n, a=0,b=1 ,c,flag=0;
printf(“enter a number”);
scanf(“%d”,&n);
do
{
    c=a+b;
    if(n= = c)
      {
        flag=1;
        break;
       }
     a=b;
     b=c;
  }while(c<=n);
if(flag = = 1)
printf(“%d is Fibonacci number”,n);
else
printf(“%d is not Fibonacci number”,n);
}


Input:-enter a number  8
Output:-8 is Fibonacci number

Comments

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

PROCEDURE:-        1.enter values for u,a,t to find distance        2.find distance with the formulae ut+1/2at 2        3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() {   float u,t,a,S;   clrscr();   printf(“enter values u,t,a”);   scanf(“%f %f %f”, &u,&t,&a);   S=(u*t)+(0.5*a*t*t);   printf(“\n  S = %f”, S); } Input:- enter values u,t,a               U=10,t=4,a=4.9 Output:- S =79.200