Question

验证“哥德巴赫”猜想：任何大于4的偶数,均可分解为两个素数之和.

Answer 1

1+1：哥德巴赫猜想

Answer 2

var
n,p,q,i,j:longint;
a,b:boolean;
begin
readln(n);
if n mod 2 =0 then
begin
p:=1;
repeat //直到循环语句
a:=true;
p:=p+1;
q:=n-p;
for i:=2 to trunc(sqrt(p)) do
if p mod i=0 then
a:=false;
b:=true;
for i:=2 to trunc(sqrt(q)) do
if q mod i=0 then
b:=false;
until a=true and b=true; //执行这段语句直到此条件成立
writeln(p,' ',q);
end
else
writeln('NO even');
end.