Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.


MIT 6.00 Intro Computer Science (OCW)
I got my questions answered at in under 10 minutes. Go to now for free help!
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.

Join Brainly to access

this expert answer


To see the expert answer you'll need to create a free account at Brainly

1 Attachment
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
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.

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

Gotcha. Good luck with it!
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'
thanks so much!! I was kinda struggling with it and I needed a different point of view..

Not the answer you are looking for?

Search for more explanations.

Ask your own question