primeChecker

// prime number outputter
#include <iostream> // cout
#include <string> // string
using namespace std;

const int MAX_PRIMES = 50;

int main() {
  int numberOfPrimes = 3; // starting number to pass 1,2,3 as prime #
  int primeNumbers[MAX_PRIMES] = {1,2,3}; // initial numbers to ignore early trouble
  double numberByTwo, numberByThree, numberByFive;
  bool   numberTwoTF, numberThreeTF, numberFiveTF;
  for (int num = 4; numberOfPrimes < MAX_PRIMES; num++) {
    numberByTwo   = num / 2;
    numberByThree = num / 3;
    numberByFive  = num / 5;
    numberTwoTF   = num % 2;
    numberThreeTF = num % 3;
    numberByFive  = num % 5;
    if (numberTwoTF == 0 || numberThreeTF == 0 || numberFiveTF == 0) { //is not prime
      //does nothing
    }
    else if (numberTwoTF == 1 && numberThreeTF == 1 && numberFiveTF == 1) { // is prime
      numberOfPrimes++;
      primeNumbers[numberOfPrimes] = num;
    }
    else {
      cout << "error";
    }
  }
  for (int i = 0; i < MAX_PRIMES; i++) {
   cout << primeNumbers[i] << ' ';
  }
}