Rosetta Code

Minimum primes: Difference between revisions

Page Discussion

Minimum primes (view source)

Revision as of 03:01, 29 October 2021

189 bytes added ,  2 years ago
Undo revision 345818 by Enter your username (talk)
m (→‎{{header|Ring}}: streamlined)
(Undo revision 345818 by Enter your username (talk))
Line 178:
 
=={{header|Ring}}==
<lang ring>? "working..."
load "stdlib.ring"
see "working..." + nl
 
Primes = []
Num1 = [ 5,45,23,21,67]
Num2Numbers1 = [435,2245,7823,4621,3867]
Num3Numbers2 = [ 943,9822,1278,5446,5338]
Numbers3 = [9,98,12,54,53]
n = len(Num1)
Nums = list(n)
for i = 1 to n▼
Nums[i] = nxtPrime(max([Num1[i], Num2[i], Num3[i]]))
next▼
 
▲for in = 1 to nlen(Numbers1)
? "The maximum prime numbers of three lists = " + fmtArray(Nums)
rvTemp = ar[1]▼
put "done..."▼
add(Temp,Numbers1[n])
add(Temp,Numbers2[n])
add(Temp,Numbers3[n])
max = max(Temp)
max--
while true
max++
if isprime(max)
if j * j > x ispr = false exit ok▼
ok
end
add(Primes,max)
▲next
 
see "Minimum primes = "
func fmtArray(ar)
see showArray(Primes)
▲ rv = ar[1]
see nl + "done..." + nl
for n = 2 to len(ar) rv += "," + ar[n] next
return "[" + rv + "]"▼
 
func nxtPrimeshowArray(xarray)
iscomp = true jtxt = 2""
while iscompsee "["
for if x % jn = 0 j =1 2to x++len(array)
else jtxt = txt + array[n] + ok","
next
▲ if j * j > x ispr = false exit ok
txt = left(txt,len(txt)-1)
end return string(x)</pre>
▲ return "["txt += rvtxt + "]"
see txt
</lang>
{{out}}
<pre>
working...
Minimum primes = [43,101,79,59,67]
▲put "done..."
</pre>
 
=={{header|Wren}}==
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/316787"