Exercise: Build a generator that retums all the prime numbers. The idea is to loop over all positive integers, test each one to see if it is prime. and if it is$,$ yiend it$.$

Exercise: implement a prime number generatior

$"0$title Exercise: implement a prime number generator

My solution is simple and not particulaply optimized,

and it is $12$ lines long.

def prine number senerator$()$:

Let us use our generator:

$[2]$

$]=1[$ break

Tests $10$ points: 'prime$\_$number$\_$generator"

for $n$ in prima$\_$number$\_$generator$()$:

if $n=33$ :

raise Exception$()$

e$214n>37$:

break