completely new to compsci. PS 1 suggest that we generate all odd integers 1 as possible prime candidates. Doesn't the generation of this set, which has an infinite number of integer-components, require infinite recursion? any hints -- not the outright answer -- for how to generate these integers?

Question

completely new to compsci. PS 1 suggest that we generate all odd integers > 1 as possible prime candidates.  Doesn't the generation of this set, which has an infinite number of integer-components, require infinite recursion?  any hints -- not the outright answer -- for how to generate these integers?

anonymous · Answer

When you find the prime you need, stop. Better stated, while the prime you need hasn't been found yet, generate a candidate.

anonymous · Answer

ok thank you for the lead ... will likely take another look at this tomorrow.

anonymous · Answer

No problem :)

anonymous · Answer

you don't have to generate them all at once, you could use xrange() with a for loop and give it a plausible upper limit http://docs.python.org/library/functions.html#xrange

anonymous · Answer

thank you, Superstar