10001th prime: Difference between revisions

10001th prime in various BASIC dialents
(10001th prime en Python)
(10001th prime in various BASIC dialents)
Line 28:
Prime 10001 is 104743
</pre>
 
=={{header|AWK}}==
<lang AWK>
Line 66 ⟶ 67:
104743
</pre>
 
 
=={{header|BASIC}}==
==={{header|BASIC256}}===
<lang BASIC256>function isPrime(v)
if v < 2 then return False
if v mod 2 = 0 then return v = 2
if v mod 3 = 0 then return v = 3
d = 5
while d * d <= v
if v mod d = 0 then return False else d += 2
end while
return True
end function
 
function prime(n)
if n=1 then return 2
p = 3
pn = 1
while pn < n
if isPrime(p) then pn += 1
p += 2
end while
return p-2
end function
 
print prime(10001)
end</lang>
 
==={{header|PureBasic}}===
<lang PureBasic>Procedure isPrime(v.i)
If v <= 1 : ProcedureReturn #False
ElseIf v < 4 : ProcedureReturn #True
ElseIf v % 2 = 0 : ProcedureReturn #False
ElseIf v < 9 : ProcedureReturn #True
ElseIf v % 3 = 0 : ProcedureReturn #False
Else
Protected r = Round(Sqr(v), #PB_Round_Down)
Protected f = 5
While f <= r
If v % f = 0 Or v % (f + 2) = 0
ProcedureReturn #False
EndIf
f + 6
Wend
EndIf
ProcedureReturn #True
EndProcedure
 
Procedure prime(n.i)
If n = 1
ProcedureReturn 2
EndIf
p.i = 3
pn.i = 1
While pn < n
If isprime(p)
pn + 1
EndIf
p + 2
Wend
ProcedureReturn p-2
EndProcedure
 
OpenConsole()
n = prime(10001)
PrintN(Str(n))
CloseConsole()</lang>
 
==={{header|Yabasic}}===
<lang yabasic>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
wend
return True
end sub
 
sub prime(n)
if n = 1 then return 2 : fi
p = 3
pn = 1
while pn<n
if isPrime(p) then pn = pn + 1 : fi
p = p + 2
wend
return p-2
end sub
 
print prime(10001)
end</lang>
 
 
=={{header|C}}==
2,169

edits