基本信息

---

下载

   源码介绍

---

哥德巴赫猜想(6~n的证明)

unsigned long main () {

unsigned long ceshi;
cin>>ceshi;
if (ceshi < 8 ) {
Sleep (1000) ;
return 0 ;
}
for(unsigned long i = 2 ; i <= ceshi ; i =2){
if(i < 8) {
cout<<"";
}
else {
unsigned long last_i = 0 ;
unsigned long a,b;
for ( a = 1 ; a < i 1 ; a ) {
for ( b = 1 ; b < i 1 ; b ) {
if ( i==a b&&ZhiShu(a)&&ZhiShu(b)&&a<b ) {
if ( i == last_i ) {
cout<<"="<<a<<" "<<b;
last_i=i;
}
else {
                        last_i=i;
cout<<endl<<endl;
    cout<<"证明数:"<<i<<endl;
    cout<<i<<"="<<a<<" "<<b;
    Sleep(100);
}
}
}
}
}
}