Revision as of 22:55, 24 August 2023 (view source) imported>Maxima enthusiast No edit summary ← Older edit		Revision as of 07:10, 7 September 2023 (view source) Chkas (talk \| contribs) m (→‎{{header\|EasyLang}}) Newer edit →
Line 586: =={{header\|EasyLang}}== <syntaxhighlight lang="easylang"> ~~proc~~fastfunc isPrime num ~~. result~~ . ~~result = 0~~ if num mod 2 = 0 and num > 2 ~~break~~return 10 . ~~for~~ i = 3 ~~step 2 to sqrt num~~ while i <= sqrt num if num mod i = 0 ~~break~~return 20 . i += 2 . ~~result =~~return 1 . curPrime = 1 ~~currentPrime = 2~~ for i = 21 to 10001▼ ~~# Because 2 is the 1st prime number,~~ ~~# We will start counting primes from the 2nd~~ ▲for i = 2 to 10001 repeat ~~currentPrime~~curPrime += 1 ~~call~~until isPrime ~~currentPrime~~curPrime ~~result~~= 1 ~~until result = 1~~ . . print ~~currentPrime~~curPrime </syntaxhighlight> {{out}}

10001th prime: Difference between revisions

10001th prime (view source)