When posting some resource or tutorial you've made, you must follow our self-promotion policies. See our policies on acceptable speech and conduct for more details. Disagreement and technical critiques are ok, but personal attacks are not.Ībusive, racist, or derogatory comments are absolutely not tolerated. Communicate to others the same way you would at your workplace.

No unprofessional/derogatory speechįollow reddiquette: behave professionally and civilly at all times. See conceptual questions guidelines for more info. If your question is similar to one in the FAQ, explain how it's different. Read our FAQ and search old posts before asking your question. Many conceptual questions have already been asked and answered.

See debugging question guidelines for more info. If you got an error, include the full error message. The output you expected, and what you got instead.A minimal, easily runnable, and well-formatted program that illustrates your problem.If you need help debugging, you must include: Print 'Number of primes generated:', len(my_primes.Welcome to LearnProgramming! New? READ ME FIRST! Posting guidelines Frequently asked questions Subreddit rules Message the moderators Asking debugging questions # Check if we need to expand the list of used primes. There are tools in the standard library you can use to simplify (a) making unbounded, counted loops and (b) checking every divisor in a range.

You could make the main 'increment' function a generator, and get access to the primes on-demand while they're being generated.

Having both breaks and returns inside a nested loop is difficult to follow. Factor out the prime detection from the add-to-list logic, and the code becomes greatly simplified.

primelst is ugly as an identifier: leaving out random vowels like that is highly un-Pythonic, and including a type name in the identifier name ('list') is counter to the spirit of duck-typing.

You could, however, use some caching to remember the number of primes to check, to avoid a complex calculation.

You don't use self.n and won't need it, since Python lists know their length.

Some notes, in addition to the fix described by others:

Prime number generator algorithm python