I don't know how to even start prob. set 1... need help.
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 :)
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.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
Think about all the steps you need to perform and write it out here in normal english.
Not sure but here goes,
First, I need to create variable--- maybe… x
Then, I would assign value to them--- x = 1000
After that, create a “for loop”---
for candidate in range(0,x):
if candidate%2 != 0:
# makes sure candidates are prime
print “prime number”, candidate
#prints out the primes
Now, I know I need to figure out if a prime is the 100th prime, and that's where I'm having a hard time. Maybe create a counter that let's me know that I computed to the 1000th prime, but I think I attempted that when I created the variable x and assigned the 1000 integer to it, although it's most likely poor (and wrong) attempt at it.
Thanks dhatraditya for your help.
* opps-- the "for loop" should be
for candidate in range(1,x):
Not the answer you are looking for? Search for more explanations.
In this case, you will only find primes between 1 and 1000. So your answer will be 997, which is the highest prime between 1 and 1000. What you need to find is the thousandth prime number, not the prime numbers between 1 and 1000
so your counter needs to count the number of primes.
for x in range (0,1000)
check whether candidate is prime
don't increment x