**⚠️ Warning: This is a draft ⚠️**

This means it might contain formatting issues, incorrect code, conceptual problems, or other severe issues.

If you want to help to improve and eventually enable this page, please fork RosettaGit's repository and open a merge request on GitHub.

== Python library ==
It looks like the isprime function from the library used in the Python example is no longer present in the new version. `is_probable_prime` is the new function. [[User:Danaj|Danaj]] ([[User talk:Danaj|talk]]) 03:28, 15 June 2015 (UTC)

:Can you give a link? --[[User:Paddy3118|Paddy3118]] :Ah, [https://pypi.python.org/pypi/pyprimes/0.2.2a found it]. It seems that isprime becomes is_prime in the later version. The link is to the earlier version so I won't hurry to update to the new library. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 04:51, 15 June 2015 (UTC)

== Ring's Code Produced Error Message ==

I tried to run Ring code suggested in this page, copy-paste to file named primo.ring

max = 9999 primes = [] for n = 1 to max if isprime(n) = 1 add(primes, n) ok next for n = 1 to len(primes) sum = 1 for m = 1 to n sum = sum * primes[m] next if (isprime(sum+1) or isprime(sum-1)) = 1 see "" + n + " " ok next

func isprime(num) if (num <= 1) return 0 ok if (num % 2 = 0) and num != 2 return 0 ok for i = 3 to floor(num / 2) -1 step 2 if (num % i = 0) return 0 ok next return 1

The code produced error message:

I used Ring version 1.10 to run the code.