/* C program for check whether number is prime number or not. */
A prime number is a number greater than 1 whose only factors are 1 and itself. Example of prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23 and 29. Numbers that have more than two factors are called composite numbers. The number 1 is neither prime nor composite.
To check whether the number is prime or not, we need to divide the number from 2 to square root of the number and if the number is not divisible by any number between the range, then the number is prime number.
Time Complexity is O(sqrt(n)).
Skills required :
Written with ♥ from Mangesh.