There is currently a prime_range function in sage.rings.fast_arith which return a list of prime in a given range {0, ..., n-1} and a function primes in sage.rings.arith which return an iterator.

We should have only one entry point and the answer would better be an iterator.

CC: @nexttime

Component: number theory

Issue created by migration from https://trac.sagemath.org/ticket/18298