In Python3 range behaves as xrange did in Python2. https://stackoverflow.com/a/94962/2071807

This kind of brute-force approach to coding is not a good way to go. Can you refactor this to write a single function which can bring back any of the cases in your switch statement?

I like this. It's clear and (kind of) easy to tell how it works. A few comments wouldn't have gone amiss though...

I didn't know about Euclid's algorithm when I solved this. I looked into prime factors a little bit, and saw how useful they'd be. Probably multiplying up to the dumbest common denominator then reducing down is crazily inefficient, but this still works nevertheless.

I decided to write a prime number generator which, looking at all these insanely concise solutions, now seems incredibly overkill.