Primes: n*2^m+1: Difference between revisions
Added Easylang
(added RPL) |
(Added Easylang) |
||
Line 571:
n: 44 m: 1 p: 89
n: 45 m: 2 p: 181</pre>
=={{header|EasyLang}}==
{{trans|FreeBASIC}}
<syntaxhighlight lang=easylang>
func isprim num .
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
for n = 1 to 45
m = 0
repeat
p = n * (pow 2 m) + 1
until isprim p = 1
m += 1
.
print n & " " & m & " " & p
.
</syntaxhighlight>
=={{header|FreeBASIC}}==
| |||