文件名称:exhaustive_verification(MAX=2^64)
介绍说明－－下载内容均来自于网络，请自行研究使用
指定范围(MAX=2^64)内穷举验证陈景润定理的“1+1”结果.
对于任何一个大偶数N,那么总可以找到奇素数P ,P",或者P1,P2,P3,使得下列两式至少一式成立："
N=P +P" (A)
N=P1+P2*P3 (B)-Designated Areas (MAX = 2 ^ 64) with exhaustive verification陈景润Theorem "1+1" As a result
对于任何一个大偶数N,那么总可以找到奇素数P ,P",或者P1,P2,P3,使得下列两式至少一式成立："
N=P +P" (A)
N=P1+P2*P3 (B)-Designated Areas (MAX = 2 ^ 64) with exhaustive verification陈景润Theorem "1+1" As a result
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Goldbach's_Conjecture.cpp
Goldbach's_Conjecture.vcproj
ReadMe.txt
Release
.......\Goldbach's_Conjecture.exe
stdafx.cpp
stdafx.h
targetver.h
Goldbach's_Conjecture.vcproj
ReadMe.txt
Release
.......\Goldbach's_Conjecture.exe
stdafx.cpp
stdafx.h
targetver.h