Question

any help! my program not working , there is an error but cannot solve it

i did this program after editing a previous program  and i tried to follow the following ;

1. Instead of printing the prime numbers from 2 to n, your program will print the first n prime numbers.

2. It will be an error if n is less than 1.

Exampl:

$ ./a 1
2

3 #include<stdio.h> 4 int p; // p is the global variable. 5 int prime(int i) // function check the prime number. 6 { int c; for(c = 2; c <i; C++) if(i%c == 0) return(0); if(c == i) // c is prime { p++; return(1); // increment the count of prime numbers 0 Control may reach end of non-void function 19 } 20 int main() 21 { int n, i = 3; printf("\nEnter the number of prime numbers required : "); scanf("%d", &n); if(n=2) // n is 1 return error. printf(" error"); else { ", n); printf("\n\nFirst %d prime numbers are : printf("\n2 "); // iteration for n prime numbers // i is the number to be checked in each iteration starting from 3 for(p = 2; p <= n; i++) { // iteration to check c is prime or n if( prime( i)) printf("\n%d ", i);

Answer 1

#include <stdio.h> int prime(int i) { int c; for (c 2; c < i; c++ ) if (i%c return 0; } / if we have reached here, it means c==i and i is prime number return 1;

int main() int n, i 2; int p 0; // to keep count of prime numbers found so far printf("\nEnter the number of prime numbers required "); scanf("%d", &n); if (n< 1) printf("Error"); return 0; printf("\n\nFirst %d prime numbers are : ", n); //We will keep checking for each value of i starting from 3 //whether it's prime or not. // If it's prime we will increase prime count 1if prime count is reached n, we will stop while(i) // initially i = 2 if (prime(i)) printf("\n%d ", i); p++ } if (p n) break; it+; } printf("\n"); return 0;

Code

#include <stdio.h>

int prime(int i)
{
   int c;
   for (c = 2; c < i; c++)
   {
       if (i%c == 0)
           return 0;
   }

   // if we have reached here, it means c==i and i is prime number
   return 1;
}

int main()
{
   int n, i = 2;
   int p = 0; // to keep count of prime numbers found so far
   printf("\nEnter the number of prime numbers required : ");
   scanf("%d", &n);
   if (n < 1)
   {
       printf("Error");
       return 0;
   }
  
   printf("\n\nFirst %d prime numbers are : ", n);

   // We will keep checking for each value of i starting from 3
   // whether it's prime or not.
   // If it's prime we will increase prime count
   // if prime count is reached n, we will stop
   while(i)
   {
       // initially i = 2
       if (prime(i))
       {
           printf("\n%d ", i);
           p++;
       }
       if (p == n)
           break;
       i++;
   }
   printf("\n");
   return 0;
}

Test Output

Enter the number of prime numbers required 8 First 8 prime numbers are 2 5 7 11 13 17 19 m n