RosettaCodeData/Task/Ormiston-triples/00-TASK.txt

25 lines
627 B
Plaintext

;Definition
An '''Ormiston triple''' is three consecutive prime numbers which are anagrams, i.e. contain the same decimal digits but in a different order.
;Example
The three consecutive primes '''(11117123, 11117213, 11117321)''' are an Ormiston triple.
;Task
* Find and show the smallest member of the first '''25''' Ormiston triples.
* Find and show the '''count''' of Ormiston triples up to one billion.
;Stretch
* Find and show the '''count''' of Ormiston triples up to ten billion.
;Reference
* [[oeis:A075093 |OEIS:A075093 - Smallest member of Ormiston prime triple]]
;Related task
* [[Ormiston pairs]]
<br>