Find squares n where n+1 is prime: Difference between revisions
Find squares n where n+1 is prime (view source)
Revision as of 17:35, 31 December 2021
, 2 years agoAdded AutoHotkey
Alpha bravo (talk | contribs) (Added AutoHotkey) |
|||
Line 24:
1 4 16 36 100 196 256 400 576 676
</pre>
=={{header|AutoHotkey}}==
{{trans|FreeBasic}}
<lang AutoHotkey>n := 0
while ((n2 := (n+=2)**2) < 1000)
if isPrime(n2+1)
result .= (result ? ", ":"" ) n2
MsgBox % result := 1 ", " result
return
isPrime(n, i:=2){
while (i < Sqrt(n)+1)
if !Mod(n, i++)
return False
return True
}</lang>
{{out}}
<pre>1, 4, 16, 36, 100, 196, 256, 400, 576, 676</pre>
=={{header|AWK}}==
<lang AWK>
| |||