Article: Integer factorization

Problem:
Emphasize O(sqrt n) running time is psuedo-polynomial, meaning n is the value of the input, not length / number of bits of input. I think if b is input size in bits, the runtime is O(sqrt(2^b))? So it's not actually "polynomial time", in contrast to the digit-by-digit addition algorithm.

Same applies to trial division for primality testing.