in the prime number finding problem last solution is like to run loop like (n*n)<=div
but if n is 2 then this condition will not work
so how this soltion correctly work
in the prime number finding problem last solution is like to run loop like (n*n)<=div
but if n is 2 then this condition will not work
so how this soltion correctly work