A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing

This Question is Closed

claiminglight
 3 years ago
Best ResponseYou've already chosen the best response.0Ok, here is something I just typed it might have a logical error I'm missing: def Prime (input, counter) divisor = inputcounter  1 for divisor != 0: y = input%divisor if y == 0: counter +=1 Prime (input,counter) elif y =! 0: return false return true

andidious
 3 years ago
Best ResponseYou've already chosen the best response.0thanks! 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.

claiminglight
 3 years ago
Best ResponseYou've already chosen the best response.0Gotcha. Good luck with it!

ushwia
 3 years ago
Best ResponseYou've already chosen the best response.0x = 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'

Francine
 3 years ago
Best ResponseYou've already chosen the best response.0thanks so much!! I was kinda struggling with it and I needed a different point of view..
Ask your own question
Ask a QuestionFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.