Write a function that calculates the first 50 prime numbersYou can do this program with two functions

Question

1) bool isPrime(int number)

2) void printPrimeNumbers(int numberOfPrimes)

Answer 1

using namespace std;

#include <iostream>

bool isPrime( int number)

{

bool boolReturn = true;

for (int n=2; n<number/2+1; n++)

{

if ((number % n)==0)

{

boolReturn = false; //found a divisor

break;

}

}

return(boolReturn);

}

void printPrimeNumbers ( int numberOfPrimes)

{

int x=2;

for (int iLoop=0; iLoop<numberOfPrimes; iLoop++)

{

while (!isPrime(x))

{

x++;

}

cout << x << endl;

x++;

}

}

int main()

{

printPrimeNumbers(50);

}