## student47 3 years ago ps1share

1. student47

2. claiminglight

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

3. andidious

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.

4. claiminglight

Gotcha. Good luck with it!

5. ushwia

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'

6. Francine

thanks so much!! I was kinda struggling with it and I needed a different point of view..