• anonymous
I'm working on problem set 1, problem 1. I think I'm close, but it's giving me a prime number that is too low to be the 1000th. Here is my code, could anyone tell me where I went wrong? primecounter = 1 # how many primes found, start 1 to include 2 primetester = int(3) # test if prime while primecounter < 1000: for x in range (2, primetester): if primetester%x == 0: primetester = primetester + 2 #not a prime else: primecounter = primecounter + 1 #is a prime primetester = primetester + 2 primetester = primetester - 2 #undo the last addition print primete
MIT 6.00 Intro Computer Science (OCW)
• Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Looking for something else?

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