(Sep-14-2018, 01:56 PM)ichabod801 Wrote: You can't. I don't understand what you are trying to do there.int(primes)
is being given as the step argument to the range function. You can't step through a sequence by multiple distances at the same time. If you want to loop through the primes to test each one against counter, you should just usefor prime in primes:
.
So the idea is that its ineficiant to divide a nummer, lets say 541, by every odd nummer up to the square root of 541. So I attempted to create a list were new primes are added as the code iterates and then only dividing the next number to be tested with primes from that list. In this way we don’t need to divide by every odd number, 3, 5, 7, 9 ect. And in this way focus on dividing by the primes, 3, 5, 7, 11 ect.
So you think I should change
for i in range(1, int(test**0.5)+1, int(primes)):With
for prime in primes(1, int(test**0.5)+1, prime):English is not my first language so feel free to speak your mind if I’m not clear enough, and I’ll try to explain better :)