#include <iostream>
#include <cmath>
bool isPrime(int num) {
if (num <= 1) {
return false;
}
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
void goldbachConjecture(int evenNum) {
for (int i = 2; i <= evenNum / 2; i++) {
if (isPrime(i) && isPrime(evenNum - i)) {
std::cout << evenNum << " = " << i << " + " << evenNum - i <<
std::endl;
return;
}
}
std::cout << "Goldbach Conjecture is false for " << evenNum <<
std::endl;
}
int main() {
int evenNum = 28; //
要
验
证
的
偶
数
goldbachConjecture(evenNum);
return 0;
}