To find whether the number entered is prime or not

I have written the simple source code to find whether the entered number is prime or not.
For this we have to know what is prime number.
Prime number is the number which is divisible by 1 and the  number itself. Lets take an example. For example 2 is prime number and 4 is not prime number or  it is composite number.

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

view raw To find whether a number is prime or not hosted with ❤ by GitHub