Nice primes: Difference between revisions
Added Easylang
(Added Easylang) |
|||
(20 intermediate revisions by 14 users not shown) | |||
Line 27:
=={{header|11l}}==
<
I a == 2
R 1B
Line 42:
L(n) 501..999
I is_prime(digital_root(n)) & is_prime(n)
print(n, end' ‘ ’)</
{{out}}
Line 51:
=={{header|Action!}}==
{{libheader|Action! Sieve of Eratosthenes}}
<
BYTE Func IsNicePrime(INT i BYTE ARRAY primes)
Line 90:
OD
PrintF("%E%EThere are %I nice primes",count)
RETURN</
{{out}}
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Nice_primes.png Screenshot from Atari 8-bit computer]
Line 101:
=={{header|ALGOL 68}}==
{{libheader|ALGOL 68-primes}}
<
INT min prime = 501;
INT max prime = 999;
Line 131:
FI
OD
END</
{{out}}
<pre>
Line 140:
=={{header|ALGOL W}}==
<
% returns the digital root of n in base 10 %
integer procedure digitalRoot( integer value n ) ;
Line 183:
end
end.
</syntaxhighlight>
{{out}}
<pre>
Line 224:
=={{header|APL}}==
{{works with|Dyalog APL}}
<
{{out}}
<pre>509 547 563 569 587 599 601 617 619 641 653 659 673 677 691 709 727 743 761 797 821 839 853 857 887 907 911 929 941 947
Line 231:
=={{header|AppleScript}}==
sumn formula borrowed from the [https://www.rosettacode.org/wiki/Nice_primes#Factor Factor] solution.
<
script o
property numberList : {missing value}
Line 272:
end nicePrimes
return nicePrimes(501, 999)</
{{output}}
<
=={{header|Arturo}}==
<syntaxhighlight lang="rebol">sumd: function [n][
s: sum digits n
(1 = size digits s)? -> return s
Line 288 ⟶ 287:
loop split.every:10 select 500..1000 => nice? 'a ->
print map a => [pad to :string & 4]</
{{out}}
Line 298 ⟶ 297:
=={{header|AWK}}==
<syntaxhighlight lang="awk">
# syntax: GAWK -f NICE_PRIMES.AWK
BEGIN {
Line 337 ⟶ 336:
return(sum)
}
</syntaxhighlight>
{{out}}
<pre>
Line 377 ⟶ 376:
=={{header|BASIC}}==
<
20 DIM P(E): P(0)=-1: P(1)=-1
30 FOR I=2 TO SQR(E)
Line 387 ⟶ 386:
90 IF J>0 THEN S=S+J MOD 10: J=J\10: GOTO 90
100 IF S>9 THEN J=S: GOTO 80 ELSE IF NOT P(S) THEN PRINT I,
110 NEXT</
{{out}}
<pre> 509 547 563 569 587
Line 398 ⟶ 397:
=={{header|BCPL}}==
<
manifest $(
begin = 500
Line 434 ⟶ 433:
writef("%N*N", i)
freevec(prime)
$)</
{{out}}
Line 470 ⟶ 469:
983
997</pre>
=={{header|C}}==
{{trans|C++}}
<
#include <stdio.h>
Line 523:
return 0;
}</
{{out}}
<pre>Nice primes between 500 and 1000:
Line 533:
=={{header|C++}}==
<
bool is_prime(unsigned int n) {
Line 567:
}
std::cout << '\n' << count << " nice primes found.\n";
}</
{{out}}
Line 581:
=={{header|D}}==
{{trans|C++}}
<
bool isPrime(uint n) {
Line 627:
writeln;
writeln(count, " nice primes found.");
}</
{{out}}
<pre>Nice primes between 500 and 1000:
Line 635:
977 983 997
33 nice primes found.</pre>
=={{header|Delphi}}==
{{works with|Delphi|6.0}}
{{libheader|SysUtils,StdCtrls}}
<syntaxhighlight lang="Delphi">
function IsPrime(N: int64): boolean;
{Fast, optimised prime test}
var I,Stop: int64;
begin
if (N = 2) or (N=3) then Result:=true
else if (n <= 1) or ((n mod 2) = 0) or ((n mod 3) = 0) then Result:= false
else
begin
I:=5;
Stop:=Trunc(sqrt(N+0.0));
Result:=False;
while I<=Stop do
begin
if ((N mod I) = 0) or ((N mod (I + 2)) = 0) then exit;
Inc(I,6);
end;
Result:=True;
end;
end;
function SumDigits(N: integer): integer;
{Sum the integers in a number}
var T: integer;
begin
Result:=0;
repeat
begin
T:=N mod 10;
N:=N div 10;
Result:=Result+T;
end
until N<1;
end;
function IsNiceNumber(N: integer): boolean;
{Return True if N is a nice number}
var Sum: integer;
begin
Result:=False;
{N must be primes}
if not IsPrime(N) then exit;
{Keep summing until one digit number}
Sum:=N;
repeat Sum:=SumDigits(Sum)
until Sum<10;
{Must be prime too}
Result:=IsPrime(Sum);
end;
procedure ShowNicePrimes(Memo: TMemo);
{Display Nice Primes between 501 and 999}
var I,Cnt: integer;
var S: string;
begin
Cnt:=0; S:='';
for I:=501 to 999 do
if IsNiceNumber(I) then
begin
S:=S+Format('%4d',[i]);
Inc(Cnt);
if (Cnt mod 5)=0 then S:=S+#$0D#$0A;
end;
Memo.Lines.Add(Format('Nice Primes: %3D',[Cnt]));
Memo.Lines.Add(S);
end;
</syntaxhighlight>
{{out}}
<pre>
Nice Primes: 33
509 547 563 569 587
599 601 617 619 641
653 659 673 677 691
709 727 743 761 797
821 839 853 857 887
907 911 929 941 947
977 983 997
</pre>
=={{header|EasyLang}}==
{{trans|11l}}
<syntaxhighlight>
fastfunc isprim num .
if num < 2
return 0
.
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
func digroot n .
return 1 + (n - 1) mod 9
.
for n = 501 to 999
if isprim digroot n = 1 and isprim n = 1
write n & " "
.
.
</syntaxhighlight>
{{out}}
<pre>
509 547 563 569 587 599 601 617 619 641 653 659 673 677 691 709 727 743 761 797 821 839 853 857 887 907 911 929 941 947 977 983 997
</pre>
=={{header|F_Sharp|F#}}==
This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_functions Extensible Prime Generator (F#)]
<
// Nice primes. Nigel Galloway: March 22nd., 2021
let fN g=1+((g-1)%9) in primes32()|>Seq.skipWhile((>)500)|>Seq.takeWhile((>)1000)|>Seq.filter(fN>>isPrime)|>Seq.iter(printf "%d "); printfn ""
</syntaxhighlight>
{{out}}
<pre>
Line 658 ⟶ 782:
({{math|<var>n</var> = 0}} may not need to be special-cased depending on the behavior of your language's modulo operator.)
<
: digital-root ( m -- n ) 1 - 9 mod 1 + ;
500 1000 primes-between [ digital-root prime? ] filter .</
{{out}}
<pre style="height:10em">
Line 704 ⟶ 828:
{{trans|Factor}}
{{works with|Gforth}}
<
: notprime! ( n -- ) here + 1 swap c! ;
Line 741 ⟶ 865:
1000 500 print_nice_primes
bye</
{{out}}
Line 752 ⟶ 876:
33 nice primes found.
</pre>
=={{header|FreeBASIC}}==
<
Function isPrime(Byval ValorEval As Integer) As Boolean
If ValorEval <= 1 Then Return False
Line 788 ⟶ 911:
Print !"\n\n"; column; " buenos n£meros encontrados."
Sleep
</syntaxhighlight>
{{out}}
<pre>
Line 804 ⟶ 927:
=={{header|Fōrmulæ}}==
{{FormulaeEntry|page=https://formulae.org/?script=examples/Nice_primes}}
'''Solution'''
[[File:Fōrmulæ - Nice primes 01.png]]
'''Test case'''
[[File:Fōrmulæ - Nice primes 02.png]]
[[File:Fōrmulæ - Nice primes 03.png]]
'''Showing nice primes in the range 500 .. 1,000'''
[[File:Fōrmulæ - Nice primes 04.png]]
[[File:Fōrmulæ - Nice primes 05.png]]
[[File:Fōrmulæ - Nice primes 06.png]]
=={{header|Go}}==
{{trans|Wren}}
<
import "fmt"
Line 864 ⟶ 1,001:
}
}
}</
{{out}}
Line 871 ⟶ 1,008:
</pre>
=={{header|Haskell}}==
<syntaxhighlight lang="haskell">
import Data.Char ( digitToInt )
isPrime :: Int -> Bool
isPrime n
|n == 2 = True
|n == 1 = False
|otherwise = null $ filter (\i -> mod n i == 0 ) [2 .. root]
where
root :: Int
root = floor $ sqrt $ fromIntegral n
digitsum :: Int -> Int
digitsum n = sum $ map digitToInt $ show n
findSumn :: Int -> Int
findSumn n = until ( (== 1) . length . show ) digitsum n
isNicePrime :: Int -> Bool
isNicePrime n = isPrime n && isPrime ( findSumn n )
solution :: [Int]
solution = filter isNicePrime [501..999]</syntaxhighlight>
{{out}}
<pre>
[509,547,563,569,587,599,601,617,619,641,653,659,673,677,691,709,727,743,761,797,821,839,853,857,887,907,911,929,941,947,977,983,997]
</pre>
=={{header|J}}==
Line 890 ⟶ 1,055:
=={{header|Java}}==
{{trans|Kotlin}}
<
private static boolean isPrime(long n) {
if (n < 2) {
Line 946 ⟶ 1,111:
System.out.printf("%d nice primes found.%n", count);
}
}</
{{out}}
<pre>Nice primes between 500 and 1000
Line 961 ⟶ 1,126:
This entry uses `is_prime` as defined at
[[Erd%C5%91s-primes#jq]].
<
# input: a non-negative integer
def sumn:
Line 973 ⟶ 1,138:
# The task:
range(501; 1000) | select(is_nice)</
{{out}}
<pre>
Line 1,010 ⟶ 1,175:
997
</pre>
=={{header|Julia}}==
See [[Strange_numbers#Julia]] for the filter_open_interval function.
<
isnice(n, base=10) = isprime(n) && (mod1(n - 1, base - 1) + 1) in [2, 3, 5, 7, 11, 13, 17, 19]
filter_open_interval(500, 1000, isnice)
</
<pre>
Finding numbers matching isnice for open interval (500, 1000):
Line 1,029 ⟶ 1,195:
=={{header|Kotlin}}==
{{trans|C}}
<
if (n < 2) {
return false
Line 1,083 ⟶ 1,249:
println()
println("$count nice primes found.")
}</
{{out}}
<pre>Nice primes between 500 and 1000:
Line 1,094 ⟶ 1,260:
=={{header|Lua}}==
{{trans|C}}
<
if n < 2 then
return false
Line 1,144 ⟶ 1,310:
n = n + 1
end
print(count .. " nice primes found.")</
{{out}}
<pre>Nice primes between 500 and 1000
Line 1,153 ⟶ 1,319:
=={{header|Mathematica}}/{{header|Wolfram Language}}==
<
summ[n_] := FixedPoint[IntegerDigits /* Total, n]
Select[Range[501, 999], PrimeQ[#] \[And] PrimeQ[summ[#]] &]</
{{out}}
<pre>{509, 547, 563, 569, 587, 599, 601, 617, 619, 641, 653, 659, 673, 677, 691, 709, 727, 743, 761, 797, 821, 839, 853, 857, 887, 907, 911, 929, 941, 947, 977, 983, 997}</pre>
=={{header|Nim}}==
<
func isPrime(n: Positive): bool =
Line 1,202 ⟶ 1,356:
for i, n in list:
stdout.write n, if (i + 1) mod 10 == 0: '\n' else: ' '
echo()</
{{out}}
Line 1,210 ⟶ 1,364:
821 839 853 857 887 907 911 929 941 947
977 983 997 </pre>
=={{header|OCaml}}==
After ruling out all multiples of three, <code>mod 9</code> (the digital root) can only return {1, 2, 4, 5, 7, 8}. Adding 6 before calculating <code>mod 9</code> makes all primes in the result even (and the composites odd), so <code>(n + 6) mod 9 land 1 = 0</code> is sufficient for checking the digital root.
<syntaxhighlight lang="ocaml">let is_nice_prime n =
let rec test x =
x * x > n || n mod x <> 0 && n mod (x + 2) <> 0 && test (x + 6)
in
if n < 5
then n lor 1 = 3
else n land 1 <> 0 && n mod 3 <> 0 && (n + 6) mod 9 land 1 = 0 && test 5
let () =
Seq.(ints 500 |> take 500 |> filter is_nice_prime |> iter (Printf.printf " %u"))
|> print_newline</syntaxhighlight>
{{out}}
<pre> 509 547 563 569 587 599 601 617 619 641 653 659 673 677 691 709 727 743 761 797 821 839 853 857 887 907 911 929 941 947 977 983 997</pre>
=={{header|ooRexx}}==
<syntaxhighlight lang="oorexx">/* REXX */
n=1000
prime = .Array~new(n)~fill(.true)~~remove(1)
p.=0
Do i = 2 to n
If prime[i] = .true Then Do
Do j = i * i to n by i
prime~remove(j)
End
p.i=1
End
End
z=0
ol=''
Do i=500 To 1000
If p.i then Do
dr=digroot(i)
If p.dr Then Do
ol=ol' 'i'('dr')'
z=z+1
If z//10=0 Then Do
Say strip(ol)
ol=''
End
End
End
End
Say strip(ol)
Say z 'nice primes in the range 500 to 1000'
Exit
digroot:
Parse Arg s
Do Until length(s)=1
dr=0
Do j=1 To length(s)
dr=dr+substr(s,j,1)
End
s=dr
End
Return s</syntaxhighlight>
{{out}}
<pre>509(5) 547(7) 563(5) 569(2) 587(2) 599(5) 601(7) 617(5) 619(7) 641(2)
653(5) 659(2) 673(7) 677(2) 691(7) 709(7) 727(7) 743(5) 761(5) 797(5)
821(2) 839(2) 853(7) 857(2) 887(5) 907(7) 911(2) 929(2) 941(5) 947(2)
977(5) 983(2) 997(7)
33 nice primes in the range 500 to 1000</pre>
=={{header|PARI/GP}}==
<syntaxhighlight lang="python">nicePrimes( s, e ) = { local( m );
forprime( p = s, e,
m = p; \\
while( m > 9, \\ m == p mod 9
m = sumdigits( m ) ); \\
if( isprime( m ),
print1( p, " " ) ) );
}</syntaxhighlight>
or
<syntaxhighlight lang="pari/gp">select( p -> isprime( p % 9 ), primes( [500, 1000] ))</syntaxhighlight>
=={{header|Perl}}==
{{libheader|ntheory}}
<
use warnings;
Line 1,230 ⟶ 1,461:
$cnt = @nice_primes;
print "Nice primes between $low and $high (total of $cnt):\n" .
(sprintf "@{['%5d' x $cnt]}", @nice_primes[0..$cnt-1]) =~ s/(.{55})/$1\n/gr;</
{{out}}
<pre>Nice primes between 500 and 1000 (total of 33):
Line 1,239 ⟶ 1,470:
=={{header|Phix}}==
{{trans|Factor}}
<!--<
<span style="color: #008080;">function</span> <span style="color: #000000;">pdr</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">return</span> <span style="color: #7060A8;">is_prime</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">and</span> <span style="color: #7060A8;">is_prime</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">+</span><span style="color: #7060A8;">remainder</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">-</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">9</span><span style="color: #0000FF;">))</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #004080;">sequence</span> <span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">filter</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">tagset</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1000</span><span style="color: #0000FF;">,</span><span style="color: #000000;">500</span><span style="color: #0000FF;">),</span><span style="color: #000000;">pdr</span><span style="color: #0000FF;">)</span>
<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"%d nice primes found:\n %s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">),</span><span style="color: #7060A8;">join_by</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">sprint</span><span style="color: #0000FF;">),</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">11</span><span style="color: #0000FF;">,</span><span style="color: #008000;">" "</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\n "</span><span style="color: #0000FF;">)})</span>
<!--</
{{out}}
<pre>
Line 1,250 ⟶ 1,481:
659 673 677 691 709 727 743 761 797 821 839
853 857 887 907 911 929 941 947 977 983 997
</pre>
=={{header|PHP}}==
{{trans|Python}}
<syntaxhighlight lang="php">
<?php
// Function to check if a number is prime
function isPrime($n) {
if ($n <= 1) {
return false;
}
for ($i = 2; $i <= sqrt($n); $i++) {
if ($n % $i == 0) {
return false;
}
}
return true;
}
// Function to sum the digits of a number until the sum is a single digit
function sumOfDigits($n) {
while ($n > 9) {
$sum = 0;
while ($n > 0) {
$sum += $n % 10;
$n = (int)($n / 10);
}
$n = $sum;
}
return $n;
}
function findNicePrimes($lower_limit=501, $upper_limit=1000) {
// Find all Nice primes within the specified range
$nice_primes = array();
for ($n = $lower_limit; $n < $upper_limit; $n++) {
if (isPrime($n)) {
$sumn = sumOfDigits($n);
if (isPrime($sumn)) {
array_push($nice_primes, $n);
}
}
}
return $nice_primes;
}
// Main loop to find and print "Nice Primes"
$nice_primes = findNicePrimes();
foreach ($nice_primes as $prime) {
echo $prime . " ";
}
?>
</syntaxhighlight>
{{out}}
<pre>
509 547 563 569 587 599 601 617 619 641 653 659 673 677 691 709 727 743 761 797 821 839 853 857 887 907 911 929 941 947 977 983 997
</pre>
=={{header|Python}}==
<syntaxhighlight lang="python">
def is_prime(n):
"""Check if a number is prime."""
if n <= 1:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
def sum_of_digits(n):
"""Calculate the repeated sum of digits until the sum's length is 1."""
while n > 9:
n = sum(int(digit) for digit in str(n))
return n
def find_nice_primes(lower_limit=501, upper_limit=1000):
"""Find all Nice primes within the specified range."""
nice_primes = []
for n in range(lower_limit, upper_limit):
if is_prime(n):
sumn = sum_of_digits(n)
if is_prime(sumn):
nice_primes.append(n)
return nice_primes
# Example usage
nice_primes = find_nice_primes()
print(nice_primes)
</syntaxhighlight>
{{out}}
<pre>
[509, 547, 563, 569, 587, 599, 601, 617, 619, 641, 653, 659, 673, 677, 691, 709, 727, 743, 761, 797, 821, 839, 853, 857, 887, 907, 911, 929, 941, 947, 977, 983, 997]
</pre>
=={{header|PL/0}}==
<syntaxhighlight lang="pascal">
var n, sum, prime, i;
procedure sumdigitsofn;
var v, vover10;
begin
sum := 0;
v := n;
while v > 0 do begin
vover10 := v / 10;
sum := sum + ( v - ( vover10 * 10 ) );
v := vover10
end
end;
procedure isnprime;
var p;
begin
prime := 1;
if n < 2 then prime := 0;
if n > 2 then begin
prime := 0;
if odd( n ) then prime := 1;
p := 3;
while p * p <= n * prime do begin
if n - ( ( n / p ) * p ) = 0 then prime := 0;
p := p + 2;
end
end
end;
begin
i := 500;
while i < 999 do begin
i := i + 1;
n := i;
call isnprime;
if prime = 1 then begin
sum := n;
while sum > 9 do begin
call sumdigitsofn;
n := sum
end;
if sum = 2 then ! i;
if sum = 3 then ! i;
if sum = 5 then ! i;
if sum = 7 then ! i
end
end
end.
</syntaxhighlight>
{{out}}
Note: PL/0 can only output one value per line, to avoid a long output, the results have been manually combined to 7 per line.
<pre>
509 547 563 569 587 599 601
617 619 641 653 659 673 677
691 709 727 743 761 797 821
839 853 857 887 907 911 929
941 947 977 983 997
</pre>
=={{header|PL/M}}==
{{Trans|ALGOL 68}}
<
BDOS: PROCEDURE( FN, ARG ); /* CP/M BDOS SYSTEM CALL */
DECLARE FN BYTE, ARG ADDRESS;
Line 1,333 ⟶ 1,713:
END;
END;
EOF</
{{out}}
<pre>
Line 1,339 ⟶ 1,719:
673(7) 677(2) 691(7) 709(7) 727(7) 743(5) 761(5) 797(5) 821(2) 839(2) 853(7) 857(2)
887(5) 907(7) 911(2) 929(2) 941(5) 947(2) 977(5) 983(2) 997(7)
</pre>
=={{header|Quackery}}==
<code>eratosthenes</code> and <code>isprime</code> are defined at [[Sieve of Eratosthenes#Quackery]].
<syntaxhighlight lang="quackery"> 1000 eratosthenes
[ 1 - 9 mod 1+ ] is digitalroot ( n --> n )
[ dup digitalroot isprime
swap isprime and ] is niceprime ( n --> b )
500 times
[ i^ 500 + niceprime if
[ i^ 500 + echo sp ] ]</syntaxhighlight>
{{out}}
<pre>509 547 563 569 587 599 601 617 619 641 653 659 673 677 691 709 727 743 761 797 821 839 853 857 887 907 911 929 941 947 977 983 997
</pre>
=={{header|Raku}}==
<syntaxhighlight lang="raku"
my @is-nice = lazy (0..*).map: { .&is-prime && .&digroot.&is-prime ?? $_ !! False };
say @is-nice[500 ^..^ 1000].grep(*.so).batch(11)».fmt("%4d").join: "\n";</
{{out}}
<pre> 509 547 563 569 587 599 601 617 619 641 653
Line 1,351 ⟶ 1,750:
Alternately, with somewhat better separation of concerns.
<syntaxhighlight lang="raku"
sub is-nice ($_) { .is-prime && .&digroot.is-prime }
say (500 ^..^ 1000).grep( *.&is-nice ).batch(11)».fmt("%4d").join: "\n";</
Same output.
=={{header|REXX}}==
<
parse arg lo hi cols . /*obtain optional argument from the CL.*/
if lo=='' | lo=="," then lo= 500 /*Not specified? Then use the default.*/
Line 1,401 ⟶ 1,800:
end /*k*/ /* [↑] only process numbers ≤ √ J */
#= #+1; @.#= j; s.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */
end /*j*/; return</
{{out|output|text= when using the default inputs:}}
<pre>
Line 1,416 ⟶ 1,815:
=={{header|Ring}}==
<
load "stdlib.ring"
Line 1,445 ⟶ 1,844:
see "done..." + nl
</syntaxhighlight>
{{out}}
<pre>
Line 1,484 ⟶ 1,883:
33: 997 > Σ = 7
done...
</pre>
=={{header|RPL}}==
≪ { } 500
'''DO'''
NEXTPRIME
'''IF''' DUP 1 - 9 MOD 1 + ISPRIME? '''THEN'''
SWAP OVER + SWAP '''END'''
'''UNTIL''' DUP 1000 ≥ '''END'''
DROP
≫ '<span style="color:blue">TASK</span>' STO
{{out}}
<pre>
1: { 509 547 563 569 587 599 601 617 619 641 653 659 673 677 691 709 727 743 761 797 821 839 853 857 887 907 911 929 941 947 977 983 997 }
</pre>
=={{header|Ruby}}==
<syntaxhighlight lang="ruby">require 'prime'
class Integer
def dig_root = (1+(self-1).remainder(9))
def nice? = prime? && dig_root.prime?
end
p (500..1000).select(&:nice?)
</syntaxhighlight>
{{out}}
<pre>[509, 547, 563, 569, 587, 599, 601, 617, 619, 641, 653, 659, 673, 677, 691, 709, 727, 743, 761, 797, 821, 839, 853, 857, 887, 907, 911, 929, 941, 947, 977, 983, 997]
</pre>
=={{header|Rust}}==
{{trans|Factor}}
<
// primal = "0.3"
Line 1,509 ⟶ 1,936:
fn main() {
nice_primes(500, 1000);
}</
{{out}}
Line 1,549 ⟶ 1,976:
=={{header|Seed7}}==
<
const func boolean: isPrime (in integer: number) is func
Line 1,578 ⟶ 2,005:
end if;
end for;
end func;</
{{out}}
<pre>
Line 1,585 ⟶ 2,012:
=={{header|Sidef}}==
<
while (n.len(base) > 1) {
n = n.sumdigits(base)
Line 1,592 ⟶ 2,019:
}
say primes(500, 1000).grep { digital_root(_).is_prime }</
{{out}}
<pre>
Line 1,600 ⟶ 2,027:
=={{header|Wren}}==
{{libheader|Wren-math}}
{{libheader|Wren-
{{libheader|Wren-fmt}}
<
import "./
import "./fmt" for Fmt
var sumDigits = Fn.new { |n|
Line 1,626 ⟶ 2,053:
}
}
}</
{{out}}
Line 1,664 ⟶ 2,091:
32: 983 -> Σ = 2
33: 997 -> Σ = 7
</pre>
=={{header|XPL0}}==
<syntaxhighlight lang="xpl0">func IntLen(N); \Return number of digits in N
int N, I;
for I:= 1 to 10 do
[N:= N/10;
if N = 0 then return I;
];
func IsPrime(N); \Return 'true' if N is prime
int N, I;
[if N <= 2 then return N = 2;
if (N&1) = 0 then \even >2\ return false;
for I:= 3 to sqrt(N) do
[if rem(N/I) = 0 then return false;
I:= I+1;
];
return true;
];
func SumDigits(N); \Return sum of digits in N
int N, Sum;
[Sum:= 0;
repeat N:= N/10;
Sum:= Sum + rem(0);
until N=0;
return Sum;
];
int C, N, SumN;
[C:= 0;
for N:= 501 to 999 do
if IsPrime(N) then
[SumN:= N;
repeat SumN:= SumDigits(SumN);
until IntLen(SumN) = 1;
if IsPrime(SumN) then
[IntOut(0, N);
C:= C+1;
if rem (C/10) then ChOut(0, ^ ) else CrLf(0);
];
];
]</syntaxhighlight>
{{out}}
<pre>
509 547 563 569 587 599 601 617 619 641
653 659 673 677 691 709 727 743 761 797
821 839 853 857 887 907 911 929 941 947
977 983 997
</pre>
|