#include
#include
#include
#include
using namespace std;
main( )
{
/* PROOF OF GOLDBACH CONJECTURE*/
/*CALCULATING PRIMES, SUM OF TWO PRIMES EQUALS GIVEN EVEN NUMBER N<5*10^19*/
/*N=Pr1+Pr2*/

unsigned long long int N=4325581707333960528; int nd=3000;
if (N<1000000) nd=300;
if (N<1000) nd=150;
unsigned long long int N1=N/2-nd; unsigned long long int N2 =N1+2*nd;
unsigned long long int p1=floor(N1/6); unsigned long long int p2=ceil( N2/6);
int r=84000; int R2[r]; int rm=p2-p1;unsigned long long int S2[r];int r3, r4, v, k;
int q=84000; int R1[q] ; int qm=rm; unsigned long long int S1[q], Q1, Q2, Ne, Nd, Nd1, Nd2; int q2, q1;
for (q=1;qj1) j1=i;
for(j=j1; jp1)&&( P1j1-1) j1=i+1;
for(j=j1; jp1)&&( P2j1) j1=i;
for(j=j1; jp1)&&( P3j1) j1=i;
for(j=j1; jp1)&&( P4

#include

#include

#include

#include

using namespace std;

main( )

{

/* PROOF OF GOLDBACH CONJECTURE*/

/*CALCULATING PRIMES, SUM OF TWO PRIMES EQUALS GIVEN EVEN NUMBER N<5*10^19*/

/*N=Pr1+Pr2*/

unsigned long long int N=4325581707333960528; int nd=3000;

if (N<1000000) nd=300;

if (N<1000) nd=150;

unsigned long long int N1=N/2-nd; unsigned long long int N2 =N1+2*nd;

unsigned long long int p1=floor(N1/6); unsigned long long int p2=ceil( N2/6);

int r=84000; int R2[r]; int rm=p2-p1;unsigned long long int S2[r];int r3, r4, v, k;

int q=84000; int R1[q] ; int qm=rm; unsigned long long int S1[q], Q1, Q2, Ne, Nd, Nd1, Nd2; int q2, q1;

for (q=1;qj1) j1=i;

for(j=j1; jp1)&&( P1j1-1) j1=i+1;

for(j=j1; jp1)&&( P2j1) j1=i;

for(j=j1; jp1)&&( P3j1) j1=i;

for(j=j1; jp1)&&( P4