Question

Hi, I have been working on the 1st problem of ps. 1 can someone tell me what is wrong with my code, I can't get it to work. Thanks.

y=7
prime=3
t=3
while prime<1000:
if y%t==0:
y=y+2
if y%t>0 and t<(1/2)*y:
t=t+2
if y%t>0 and t==(1/2)*y:
t=3
y=y+2
prime=prime+1

Answer 1

What is % do?

Answer 2

it gives you the remainder

Answer 3

Oh ok.

Answer 4

What happens if y = 53 and t = 27?

Answer 5

i changed that and now it gives me a number but it isn't prime and it is far from the 100th prime.

Answer 6

Getting it all in one while loop gets pretty complicated. If you can do it then great, but it wont look pretty. I looked it up online and I saw people split it up into a function and function or a function and while loop.
For example- try splitting it up into -
findPrime(number) function:
code
while count<1000
code

Here is a website that really helped- http://pythonism.wordpress.com/2008/05/04/looking-at-prime-numbers-in-python/