Write a void function that uses two nested for loops and the modulus (%) operator to detect and print to standard output the first n prime integers. Recall that a prime number is a number that is evenly divisible only by 1 and itself. Hint: the function prototype is: primeGen(int n);
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.