My calculation of primenumbers is nearly working out, only sometimes it gives a primenumber that is not a primenumber at all, like 5405, 5615, 6035 or even 95. I find it really weird and do not see why this happens...

My Code is here: http://dpaste.com/1324943/

Thank you guys!

Question

My calculation of primenumbers is nearly working out, only sometimes it gives a primenumber that is not a primenumber at all, like 5405, 5615, 6035 or even 95. I find it really weird and do not see why this happens...

My Code is here: http://dpaste.com/1324943/

Thank you guys!

anonymous · Answer

the % operator might help http://docs.python.org/2.7/library/stdtypes.html#numeric-types-int-float-long-complex strategically placed print statements can help alot - it shows you what is going on in your code

e.mccormick · Answer

Are you just trying to find the n$^{th}$ prime?  Because it also skips 2 and 3....

e.mccormick · Answer

And you forgot to reset your divisor when you find something is non-prime, so the test point is past 5 when it checks 95.

e.mccormick · Answer

Oh...  one last thing, you are doing an import math... why?

e.mccormick · Answer

I made a fixed version. I suggest playing with mod, %, like bwCA says and resetting divisor to 3 on failures. If that does not do it, then look at the fixed version. http://dpaste.com/hold/1325399/

e.mccormick · Answer

This one is also based on yours, does not use %, and deals with another issue... the +2 after finding the last prime! http://dpaste.com/hold/1325422/

anonymous · Answer

@theo92 - i added some print statements to your code.

anonymous · Answer

Thank you, with your advice i could fix the problem.