Ormiston pairs: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) m (Move Python entry to correct position) |
Thundergnat (talk | contribs) m (→{{header|Raku}}: slightly more efficient, move computation out of the hot loop) |
||
| Line 376: | Line 376: | ||
use List::Divvy; |
use List::Divvy; |
||
my @primes = lazy (^∞).hyper.grep |
my @primes = lazy (^∞).hyper.grep( &is-prime ).map: { $_ => .comb.sort.join }; |
||
my @Ormistons = @primes.kv.map: { ($^value, @primes[$^key+1]) if $^value. |
my @Ormistons = @primes.kv.map: { ($^value.key, @primes[$^key+1].key) if $^value.value eq @primes[$^key+1].value }; |
||
say "First thirty Ormiston pairs:"; |
say "First thirty Ormiston pairs:"; |
||