Forwarding you to blogs.perl.org

Infinite work is less work | Damian Conway [blogs.perl.org]

The first task of last week's Perl Weekly Challenge was to print the first ten strong and weak primes. A prime pn is "strong" if it's larger than the average of its two neighbouring primes ( i.e. pn > (pn-1+pn+1)/2 ). A prime is "weak" if it's smaller than the average of its two neighbours.