I need a little assistance with pst1a. Here is a copy of my code.
http://dpaste.com/534798/
My thinking was, before count hits 1000, add 1 to x. If it is odd, do a for loop on it dividing x by every integer from 2 to x. If there is a remainder and x is not divided by itself then it must be prime, add to the list, add a count and break. So far its only giving me back all the odd numbers. Where did I go wrong in this logic?

See more answers at brainly.com

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.