Jump to content

Strange unique prime triplets: Difference between revisions

m
→‎{{header|REXX}}: reduced verbosity in the output prose.
m (→‎{{header|REXX}}: reduced verbosity in the output prose.)
Line 327:
end /*m*/
say
say 'Found ' commas(finds) " unique triplet strange primes which sum< to" a prime," commas(hi+1) ,
" each triplet numbers are < " which sum to a commas(hi+1)prime."
exit 0 /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
Line 351:
<pre>
list of unique triplet strange primes that sum to a prime:
prime generation took 0.02 seconds.
 
3 5 11 sum to: 19
Line 395 ⟶ 396:
19 23 29 sum to: 71
 
Found 42 unique triplet strange primes < 30 which sum to a prime, each triplet numbers are < 30.
</pre>
 
{{out|output|text=&nbsp; when using the input of: &nbsp; &nbsp; <tt> -1000 </tt>}}
<pre>
Found 241,580 unique triplet strange primes which sum< to a prime1,000 eachwhich tripletsum numbersto area < 1,000prime.
</pre>
 
Cookies help us deliver our services. By using our services, you agree to our use of cookies.