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