Prime numbers of given sum

// 10.21.2019
// Sources: https://en.cppreference.com/w/cpp/io/manip/left,
#include <iostream>
#include <iomanip>
#include <stdio.h>
using namespace std;

bool isPrime(int n);
bool showPrimePair(int n);

const int MAX = 100000;

// Function checks if number is prime
//links to showPrimePair
bool isPrime(int n) {
    bool prime = true;
    for (int i = 2; i <= n / 2; ++i)
    {
        if (n % i == 0) // condition for nonprime number
        {
            prime = false;
            break;
        }
    }
    return prime;
}

// Function for showing prime pairs.  Integer as a Sum of Two Prime Numbers
bool showPrimePair(int n) {
    bool foundPair = true;
    for (int i = 2; i <= n / 2; ++i)
    // condition for i to be a prime number
    {
        if (isPrime(i) == 1)
        {
            // condition for n-i to be a prime number
            if (isPrime(n - i) == 1)
            {
                // n = primeNumber1 + primeNumber2
                std::cout << " " << std::left << std::setw(8) << n << " " << std::left << std::setw(8) << i << " " << std::left << std::setw(8) << n - i << endl;
                foundPair = true;
                break;
            }
        }
    }
    if (foundPair == false) {
        cout << " Conjecture fails!" << endl;
        return 0;
    }
    return foundPair;
}

// Main program in listing conjectures for all even numbers from 4-100,000 along q/ 2 primes that add up to same number.
int main()
{
    cout << "Goldbach's Conjecture by Tony Pham " << endl;
    std::cout << std::left << std::setw(8) <<" Number " << std::left << std::setw(8) << " Prime " << std::left << std::setw(8) << " Prime " << endl;
    for (int x = 0; x <= MAX; x+=2) {
        showPrimePair(x);
    }
    cout << "Enter any character to quit: ";
    cin.get();
}