unsigned long next_seed(unsigned long cur_seed)
{
unsigned long i;
for (i = cur_seed + 1; i <= sqrt(max_num); i++)
if (check_Prime(i) == 1)
return i;
return 0;
}
void seed_primes()
{
unsigned long i;
unsigned long j = 3;
unsigned long sqrt_n = sqrt(sqrt(max_num));
while(j <= sqrt_n + 1){
for(i=k; i*k <= sqrt(max_num)+1; i++)
set_NotPrime;
j++;
while(!check_Prime(j))
j++;
}
}
void printPrimes(char print){
unsigned long i;
unsigned long j=0;
if(max_num > 2 && print == 'y')
printf("2\n");
for(i=3;i<=max_num; i = i+2){
if(check_Prime(i)){
if(print == 'y')
printf("%lu\n",i);
j++;
}
}
printf("There are %lu primes between 0 and %lu\n", j+1, max_num);
}
int main(){
int start,end;
printf("enter the number start:- ");
scanf("%d",&start);
printf("enter the number end:- ");
scanf("%d",&end);
int i;
for(i=start;i<=end;i++){
if(check_Prime(i))
printf("%d\n",i);
}
return 0;
}
