Ormiston pairs: Difference between revisions
m
→{{header|Raku}}: slightly more efficient, move computation out of the hot loop
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:
use List::Divvy;
my @primes = lazy (^∞).hyper.grep
my @Ormistons = @primes.kv.map: { ($^value.key, @primes[$^key+1].key) if $^value.
say "First thirty Ormiston pairs:";
| |||