Nice primes: Difference between revisions

Content added Content deleted
(Created page with "{{task}} ::#   Take an integer n, greater than zero. ::#   sumn is sum of n's digits ::#   If sumn's lenght greater than 1 repeat the (2) for n = sumn ::# &nbsp...")
 
(Add Factor)
Line 13: Line 13:
1 + 6 = 7 (prime)
1 + 6 = 7 (prime)
</pre>
</pre>

=={{header|Factor}}==
<lang factor>USING: math math.primes prettyprint sequences ;

: digital-root ( m -- n ) 1 - 9 mod 1 + ;

500 1000 primes-between [ digital-root prime? ] filter .</lang>
{{out}}
<pre style="height:10em">
V{
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|Ring}}==
=={{header|Ring}}==