> N/2, this is the upper limit of the factoring process
You can improve that to sqrt(N).
Still this is probably the worst (most inefficient) way to prove primality.
> N/2, this is the upper limit of the factoring process
You can improve that to sqrt(N).
Still this is probably the worst (most inefficient) way to prove primality.