Find adjacent primes which differ by a square integer: Difference between revisions
Content added Content deleted
(Added Wren) |
(add fermat) |
||
Line 41: | Line 41: | ||
return 0; |
return 0; |
||
}</lang> |
}</lang> |
||
=={{header|Fermat}}== |
|||
<lang fermat>Func Issqr( n ) = if (Sqrt(n))^2=n then 1 else 0 fi.; |
|||
i:=3; |
|||
j:=3; |
|||
while j<1000000 do |
|||
j:=i+2; |
|||
while j < 1000000 do |
|||
if Isprime(j) then |
|||
if j-i>36 and Issqr(j-i) then !!(i,j,j-i) fi; |
|||
i:=j; |
|||
fi; |
|||
j:=j+2; |
|||
od; |
|||
od;</lang> |
|||
=={{header|FreeBASIC}}== |
=={{header|FreeBASIC}}== |