To check whether a number is prime or composite using recursive function

In this page I have kept the concept of checking whether a number is prime or composite using recursive function.However 1 is neither prime nor composite but in this programme 1 has been shown as composite. The source code of this programme is
given below:

	#include<stdio.h>
	#include<conio.h>
	int main()
	{
	int n,i;
	printf("enter any number");
	scanf("%d",&n);
	i=2;
	while(i<n)
	{
	if(n%i==0)
	break;
	i++;
	}
	if(i==n)
	printf("The entered number is prime");
	else
	printf("The entered number is composite");
	getch();
	}

view raw To check whether a number is prime or composite using recursive function hosted with ❤ by GitHub