Suppose you have to solve a Project Euler Problem 10 (https://projecteuler.net/problem=10); that is, to find the sum of all the primes below 2 million. How can you iterate through an infinite container like prime numbers?
