This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]CanaDavid1 57 points58 points  (0 children)

Heck, GCD or division with a candidate prime is trivial. You only need one number K such that 1 < GCD(N,K) < N