anonymous
  • anonymous
ps1share
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.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
1 Attachment
anonymous
  • anonymous
Ok, here is something I just typed- it might have a logical error I'm missing: def Prime (input, counter) divisor = input-counter - 1 for divisor != 0: y = input%divisor if y == 0: counter +=1 Prime (input,counter) elif y =! 0: return false return true
anonymous
  • anonymous
thanks! I'm watching lecture 4 right now, figuring out how the 'return' keyword works. I was a bit hesitant to go beyond lecture 2, since that was when the problem set was assigned.

Looking for something else?

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

More answers

anonymous
  • anonymous
Gotcha. Good luck with it!
anonymous
  • anonymous
x = 2 d = 2 #divisor count =0 max_count = 10 prime_count = 0 ## is 100 prime? first divide it by 2. if it has no remainder, it is not prime. ##otherwise continue checking... while prime_count < 1000: while x>d: if x%d == 0: ## print (x is not prime) count = count + 1 x = x+1 d = 2 else: d = d+1 if x == d: #print (x, "is prime") count = count + 1 prime_count = prime_count + 1 x = x +1 d = 2 print x - 1 ,'is the' ,prime_count ,'th prime'
anonymous
  • anonymous
thanks so much!! I was kinda struggling with it and I needed a different point of view..

Looking for something else?

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