//QN1.

Range of Fibonacci series using udf

//@Author:Kabina giri

#include<stdio.h>

void fibonacci (int);

int main()

int limit;

printf("Enter the numbers to be printed\n ");

scanf("%d",&limit);

fibonacci(limit);

return 0;

void fibonacci(int num)

int n1=0,n2=1,n3,count;

printf("Fibonacci Series\n");

printf("%d\n%d\n",n1,n2);

for(count=3;count<=num;count++)

n3=n1+n2;

printf("%d\n",n3);

n1=n2;

n2=n3;

Output:
//Range of perfect number

//@Author:Kabina giri

#include<stdio.h>

#include<conio.h>

void main()

int low,high,i,sum=0;

printf("Enter starting number");

scanf("%d",&low);

printf("Enter Last number");

scanf("%d",&high);

while(low<=high)

sum=0;

for(i=1;i<=low/2;i++)

if(low%i==0)

sum=sum+i;

}
 }

if(sum==low)

printf("&d is a perfect number\n",low);

else

printf("%d is not perfect number\n",low);

low++;

Output: