Additive primes: Difference between revisions

Content deleted Content added
m →‎{{header|REXX}}: added/changed comments and whitespace, highlighted the filters, added a foot separator, simplified the code.
Added Quackery.
Line 825: Line 825:
<pre>2 3 5 7 11 23 29 41 43 47 61 67 83 89 101 113 131 137 139 151 157 173 179 191 193 197 199 223 227 229 241 263 269 281 283 311 313 317 331 337 353 359 373 379 397 401 409 421 443 449 461 463 467 487
<pre>2 3 5 7 11 23 29 41 43 47 61 67 83 89 101 113 131 137 139 151 157 173 179 191 193 197 199 223 227 229 241 263 269 281 283 311 313 317 331 337 353 359 373 379 397 401 409 421 443 449 461 463 467 487
Number of additive primes less than 500: 54</pre>
Number of additive primes less than 500: 54</pre>

=={{header|Quackery}}==

<code>eratosthenes</code> and <code>isprime</code> are defined at [[Sieve of Eratosthenes#Quackery]].

<code>digitsum</code> is defined at [[Sum digits of an integer#Quackery]].

<lang Quackery> 500 eratosthenes
[]
500 times
[ i^ isprime if
[ i^ 10 digitsum
isprime if
[ i^ join ] ] ]
dup echo cr cr
size echo say " additive primes found."</lang>

{{out}}

<pre>[ 2 3 5 7 11 23 29 41 43 47 61 67 83 89 101 113 131 137 139 151 157 173 179 191 193 197 199 223 227 229 241 263 269 281 283 311 313 317 331 337 353 359 373 379 397 401 409 421 443 449 461 463 467 487 ]

54 additive primes found.</pre>



=={{header|Raku}}==
=={{header|Raku}}==