Minimum primes: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
Line 10: | Line 10: | ||
then: |
then: |
||
# Select the maximum (max) of Numbers[n], Numbers2[n] and Numbers3[n], where '''n <= 5''' (one based). |
# Select the maximum (max) of Numbers[n], Numbers2[n] and Numbers3[n], where '''n <= 5''' (one based). |
||
# Select minPrime for that minPrime is prime and '''minPrime |
# Select minPrime for that minPrime is a minimal prime and '''minPrime >= max''' |
||
# Add minPrime to a new list (Primes) |
# Add minPrime to a new list (Primes) |
||
# Show Primes on this page. |
# Show Primes on this page. |
Revision as of 17:33, 27 October 2021
Minimum primes 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
Given three lists:
- Numbers1 = [5,45,23,21,67]
- Numbers2 = [43,22,78,46,38]
- Numbers3 = [9,98,12,54,53]
then:
- Select the maximum (max) of Numbers[n], Numbers2[n] and Numbers3[n], where n <= 5 (one based).
- Select minPrime for that minPrime is a minimal prime and minPrime >= max
- Add minPrime to a new list (Primes)
- Show Primes on this page.
Ring
<lang ring> load "stdlib.ring" see "working..." + nl
Primes = [] Numbers1 = [5,45,23,21,67] Numbers2 = [43,22,78,46,38] Numbers3 = [9,98,12,54,53]
for n = 1 to len(Numbers1)
Temp = [] add(Temp,Numbers1[n]) add(Temp,Numbers2[n]) add(Temp,Numbers3[n]) max = max(Temp) max-- while true max++ if isprime(max) exit ok end add(Primes,max)
next
see "Minimum primes = " see showArray(Primes) see nl + "done..." + nl
func showArray(array)
txt = "" see "[" for n = 1 to len(array) txt = txt + array[n] + "," next txt = left(txt,len(txt)-1) txt = txt + "]" see txt
</lang>
- Output:
working... Minimum primes = [43,101,79,59,67] done...