10001th prime: Difference between revisions
Content added Content deleted
(add fermat) |
(add parigp) |
||
Line 15: | Line 15: | ||
{{out}} |
{{out}} |
||
<pre>104743</pre> |
<pre>104743</pre> |
||
=={{header|PARI/GP}}== |
|||
<lang parigp>prime(10001)</lang> |
|||
{{out}}<pre>%1 = 104743</pre> |
|||
=={{header|Ring}}== |
=={{header|Ring}}== |
Revision as of 19:24, 16 November 2021
10001th prime is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
- Task
Find and show on this page 10001th prime
Fermat
<lang fermat> Prime(10001); </lang>
- Output:
104743
J
<lang j>p:10000 NB. the index starts at 0; p:0 = 2</lang>
- Output:
104743
PARI/GP
<lang parigp>prime(10001)</lang>
- Output:
%1 = 104743
Ring
<lang ring> load "stdlib.ring" see "working..." + nl num = 0 pr = 0 limit = 10001
while true
num++ if isprime(num) pr++ ok if pr = limit exit ok
end
see "" + num + nl see "done..." + nl </lang>
- Output:
working... The 10001th prime is: 104743 done...