Rosetta Code

Circular primes: Difference between revisions

Page Discussion

Circular primes (view source)

Revision as of 11:17, 16 October 2021

22 bytes removed ,  2 years ago
→‎{{header|Ring}}
(Forth version)
Line 2,059:
=={{header|Ring}}==
<lang ring>
see "working..." + nl
load "stdlib.ring"
Thesee first"First 19 circular primesnumbers are:" + nl▼
primn = 0▼
numrow = 0 ▼
aPrimesPrimes = []▼
 
while numrow < limit19▼
limit = 20
okn++▼
▲prim = 0
▲num = 0
▲aPrimes = []
 
▲while num < limit
flag = 1
primnStr = prim + 1string(n)
primStrlenStr = stringlen(primnStr)
for nm = 1 to len(primStr)-1lenStr
str1leftStr = substrleft(primStrnStr,n+1,len(primStr)-nm)
str2rightStr = substrright(primStrnStr,1,nlenStr-m)
primNewstrOk = str1rightStr + str2leftStr
primNumnOk = number(primNewstrOk)
ind = find(Primes,nOk)
if isprime(primNum) and isprime(prim) and primNum >= prim and prim > 9
if ind < flag1 and strOk != 1nStr
else add(Primes,nOk)
ok
if not isprimeNumber(nOk) or ind > 0
flag = 0
exit
ok
next
if isprime(prim) and primflag <= 101
flag = 1row++
but not isprime(prim) and primsee <"" 10+ n + " "
flag if row%5 = 0
ok see nl
if flag = 1 ok
num = num + 1ok
add(aPrimes,prim)
▲ ok
end
 
see "Thenl first+ 19 circular primes are:"done..." + nl
showarray(aPrimes)
 
func showarrayisPrimeNumber(vectnum)
if (num <= 1) return 0 ok
see "["
if (num % 2 = 0) and (num != 2) return 0 ok
svect = ""
for ni = 12 to lensqrt(vectnum)
if (num % svecti = svect +0) vect[n]return +0 ","ok
next
return 1
see left(svect, len(svect) - 1) + "]"
</lang>
{{out}}
<pre>
working...
▲The first 19 circular primes are:
First 19 circular numbers are:
[2,3,5,7,11,13,17,37,79,113,197,199,337,1193,3779,11939,19937,193939,199933]
2 3 5 7 11
13 17 37 79 113
197 199 337 1193 3779
11939 19937 193939 199933
done...
</pre>
 
CalmoSoft
2,468

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/299609"