Project Euler：Problem 46 Goldbach's other conjecture

It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.

9 = 7 + 2×1²
15 = 7 + 2×2²
21 = 3 + 2×3²
25 = 7 + 2×3²
27 = 19 + 2×2²
33 = 31 + 2×1²

It turns out that the conjecture was false.

What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?

#include <iostream>
using namespace std;

bool isPrime[1000010];

bool gold(int n)
{
	for (int i = 2; i < n; i++)
	{
		if (isPrime[i] == true)
		{
			
			int tmp = n - i;
			//cout << i << " " << tmp << endl;
			if (tmp % 2 == 0)
			{
				int k = sqrt(tmp / 2);
				if (k*k == tmp / 2)
					return true;
			}
		}
	}
	return false;
}

int main()
{
	memset(isPrime, true, sizeof(isPrime));
	for (int i = 2; i <= 1010; i++)
	{
		if (isPrime[i])
		{
			for (int j = 2; j*i < 1000010; j++)
			{
				isPrime[i*j] = false;
			}
		}
	}

	//int a = gold(15);


	for (int i = 2; i <= 1000000; i++)
	{
		if (isPrime[i] == false && i % 2 == 1)
		{
			if (!gold(i))
			{
				cout << i << endl;
				break;
			}
		}
	}
	system("pause");
	return 0;
}

Project Euler：Problem 46 Goldbach's other conjecture

标签：project euler   c++