Hi!
There is an algorithm called the sieve of erastothenes to find a list of prime numbers on a list from 2 to n. I found an implementation of this algorithm saying that you need to iterate prove all the posible divisor from 2 to the square root of n.
Why is that?

See more answers at brainly.com

The reason taht I need to iterate from 2 to the square root of n, is a mathematical reason.

I just read that I did not understand, but I will work on that thank you @FoolAroundMath =)

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.