bool isPrime(int num)
{
   //if num is equal to 2 then return true;
 
   //check if num is divisible by anything else other than its self
    for( i = 2; i < num; i++) 
    {
        // if num mod i is equal to 0 then num is not a prime number so return false
     }
 
//if it passed the loop then it is a prime number so return true
}

//inside your main
 for i is equal to 2, until MAX 
  {
          //call isPrime with the argument being i. check if it return true 
          // if it return true then print to screen that it is a prime
          //else do nothing
   }

bool isPrime(int num)
{
   if(num < 2 ) return false;
   else if(num == 2) return true;
 
     for(int i = 2; i < ceil ( sqrt(num) ); i++)
             if(num % i == 0) return false;
  return true;
}
 
void printPrime(const int Max = 100)
{
     for(int i = 2; i  < MAX; i++)
            if( isPrime(i)) cout << i <<" is Prime\n";
 
}

    //the calulation function.
void calc (unsigned int number, unsigned int i) //using "void" instead of "int", because the funktion doesn't need to return a value.
    {
        //define variables
    bool Primecheck; //bool, that indicates wether the number is a prime or not (1 = Prime, 0 = Not a prime). Bool is used instead of int, since it only has to store 2 values (1 and 0).
    unsigned int a = 0; //set a = 1, used to number the primes.
    unsigned int j;
 
        //write welcome message
    cout << endl << "The program is finding primes in the domain of \"" << i << " ---> " << number << "\"" << endl; //tell the entered domain on the screen
    out << "The program is finding primes in the domain of \"" << i << " ---> " << number << "\"" << endl; //same as above, just to the file.
 
        //Calcul funktion
    for (; i<=number; i++) //run the "i" loop, when "i" is less or equal (<=) to the input number., then +1 for each completed cycle.
        {
        Primecheck=1; //set the boolic value of primecheck = true, for the "i" loop. (to avoid a negativ loop, basically you'll have to set "not prime" each cycle, because everything is considered a prime at this point.)
 
            //Filtering function, filters all non primes, and sets "primecheck = 0", if the tested number isn't a prime.
        for (j=2; ((j < i) && (Primecheck==1)); j++) //run the "j" loop, run this until the "j" value is equal to the "i" value, by plussing 1, each time the cycle completes, starting from 2.
            {if ((i%j)==0){Primecheck=0;}} //if "i" divided by "j" equals "0 in remainder", then set "Primecheck = 0" (number is not a prime). If i%j=0, then that's an devident, and therefore "i" isn't a prime number.
 
            //Screen / file output
        if(Primecheck!=0) //if number is a prime, then write output.
            {
            a++; //add +1 to "a", simply to be ready number the next prime.
            cout << a << ". " << "Prime:\t"<< i << endl;  //screen output - write "a" (1 as default (used to show which number in the prime number chain the prime number is)), then write "Prime:" then the number (the prime) "i".
            }
 
        //terminate for "i" loop, when "i" has reached the max domain number.
        }
 
        //write end message
    cout << a << " primes was found; in the given domain!" << endl << endl; //announce the number of primes found on the screen.
 
    //terminate function
    }