验证哥德巴赫猜想

#include
using namespace std;

double lerangde(double x,int n)
{
if (n == 0)
return 1;
if (n == 1)
return x;
if (n > 1);
return ((2 * n - 1) * x * lerangde(x, n - 1) - (n - 1) * lerangde(x, n - 2)) / n;
}
int main()
{
double x;
int n;
cin >> x >> n;
cout << lerangde(x, n);
return 0;
}