Jump to content

Mersenne primes: Difference between revisions

Mersenne primes in various BASIC dialents
(Mersenne primes in various BASIC dialents)
Line 132:
2 ^ 61 - 1
</pre>
 
 
=={{header|BASIC}}==
==={{header|BASIC256}}===
{{trans|FreeBASIC}}
<lang BASIC256>m = 0
while True
m += 1
if isPrime((2^m)-1) = True then print m
end while
end
 
function isPrime(v)
if v <= 1 then return False
for i = 2 To int(sqr(v))
if v % i = 0 then return False
next i
return True
end function</lang>
{{out}}
<pre>
Igual que la entrada de FreeBASIC.
</pre>
 
==={{header|FreeBASIC}}===
<lang freebasic>Function isPrime(Byval ValorEval As Integer) As Boolean
If ValorEval <= 1 Then Return False
For i As Integer = 2 To Int(Sqr(ValorEval))
If ValorEval Mod i = 0 Then Return False
Next i
Return True
End Function
 
Dim As Integer m = 0
While True
m += 1
If isPrime((2^m)-1) Then Print m
Wend
Sleep</lang>
{{out}}
<pre>2
3
5
7
13
17
19
31</pre>
 
==={{header|Yabasic}}===
{{trans|FreeBASIC}}
<lang yabasic>m = 0
while True
m = m + 1
if isPrime((2^m)-1) = True then print m : fi
wend
end
 
sub isPrime(v)
if v < 2 then return False : fi
if mod(v, 2) = 0 then return v = 2 : fi
if mod(v, 3) = 0 then return v = 3 : fi
d = 5
while d * d <= v
if mod(v, d) = 0 then return False else d = d + 2 : fi
end while
return True
end sub</lang>
{{out}}
<pre>
Igual que la entrada de FreeBASIC.
</pre>
 
 
=={{header|C}}==
2,169

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.