C 驗證哥德巴哈猜想

來源:互聯網
上載者:User
#include<math.h>int checkPrimer(double a){       //驗證是否為質數    unsigned long i, asqrt;    asqrt = (unsigned long)sqrt(a);    for(i =2;i<= asqrt;i++){       if((int)a % i == 0)           return 0;    }    return 1;}int checkTruth(unsigned long a, unsigned long *NumberA , unsigned long *NumberB){    unsigned long i, half  = a/2;    for(i=3; i<half; i+=2){        if(checkPrimer((double)i) && checkPrimer((double)(a-i))){             *NumberA = i;             *NumberB = a-i;             return 1;        }    }    return 0;}test.h 檔案#include <stdio.h>#include<math.h>#include "test1.h"void main(){        unsigned long a ,p1,p2;    do{       printf("請輸入不小於6的偶數\n");       scanf("%lu",&a);       if( a>=6 && a%2 ==0 ){           if(checkTruth(a,&p1,&p2)){               printf("OK , %d   %d\n",p1,p2);           }else{               printf("sorry!");           }       }         }while(a !=0);    return ;} test.c 檔案

判斷一個大於6的偶數都可以是由兩個質數組成

運行結果:

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.