Additive primes: Difference between revisions

Content added Content deleted
Line 1,614: Line 1,614:
If is_prime[x] And is_prime[GetSumOfDigits(x)] Then
If is_prime[x] And is_prime[GetSumOfDigits(x)] Then
Begin
Begin
write(x,' ');
write(x:4);
inc(counter);
inc(counter);
End;
End;
Line 1,622: Line 1,622:
If is_prime[x] And is_prime[GetSumOfDigits(x)] Then
If is_prime[x] And is_prime[GetSumOfDigits(x)] Then
Begin
Begin
write(x,' ');
if counter mod 10 = 0 then writeln();
write(x:4);
inc(counter);
inc(counter);
End;
End;
Line 1,634: Line 1,635:
{{out}}
{{out}}
<pre>
<pre>
2 3 5 7 11 23 29 41 43 47 61 67 83 89 101 113 131
2 3 5 7 11 23 29 41 43 47
137 139 151 157 173 179 191 193 197 199 223 227 229 241 263 269 281
61 67 83 89 101 113 131 137 139 151
157 173 179 191 193 197 199 223 227 229
⚫
283 311 313 317 331 337 353 359 373 379 397 401 409 421 443 449 461
241 263 269 281 283 311 313 317 331 337
⚫
463 467 487
⚫
353 359 373 379 397 401 409 421 443 449
⚫
461 463 467 487


54 additive primes found.
54 additive primes found.
Retrieved from "https://rosettacode.org/wiki/Additive_primes"