|
The program is to find all the
prime numbers in the range, which starts from zero and ends
at user defined limit. A prime
number is a one, whose divisors are 1 and the number
itself.
Logic:
This is a slightly modified
version of the
previous program. Here, user need to enter the number as
the upper limit for the for the iteration loop to find the
prime number The outer for loop traces the iteration till
the limit,, wherein each of iteration inner for loop checks
the present number is prime or not,
with
the previous program's logic. If it is, it prints out the
present number.
In this program, the lower limit
is constant zero. We can change that also, to make the program
fully flexible, and
to print out all the perfect number between the given range.
|
|
|
Program
to find the prime numbers below a given number.
#include<stdio.h>
void main()
{
int i, prime, lim_up, n;
clrscr();
printf("\n\n\t ENTER THE UPPER LIMIT...: ");
scanf("%d", &lim_up);
printf("\n\n\t PRIME NUMBERS ARE...: ");
for(n=1; n<lim_up; n++)
{
prime = 1;
for(i=2; i<n; i++)
if(n%i == 0)
{
prime = 0;
break;
}
if(prime)
printf("\n\n\t\t\t%d",n);
}
getch();
}
Download exe and source code here.
Related source codes :
Program
to find whether a number is prime or not.
Program to find the
prime numbers between a given range.
Select program from the list |