Question

ps1share

Answer 1

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

Answer 2

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.

Answer 3

Gotcha. Good luck with it!

Answer 4

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'

Answer 5

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