Reply to post:

Give a boffin a Xeon and a big GPU, get a new big prime number

GrumpenKraut

> 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.

POST COMMENT House rules

Not a member of The Register? Create a new account here.

  • Enter your comment

  • Add an icon

Anonymous cowards cannot choose their icon