Just for completeness, check the "short" solutions posted here: Re^3: Fibonacci Sequence. The title says it is on Fibonacci sequences but this post is offering prime numbers.
More seriously:
use strict; use warnings; my @primes; PRIME: for my $n (2..100) { for my $p (@primes) { next PRIME unless $n % $p; } push @primes, $n; } print "@primes\n";
In reply to Re: Perl vs. Python for prime numbers
by hdb
in thread Perl vs. Python for prime numbers
by Anonymous Monk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |