What and how many methods are there for Prime Factorization?
I can think of a few
1) Sieve of Eratosthenes (Inefficient for large numbers) 2) Find by succesive trial and erros if it has any factors less than the root of the number. 3) Fermat's method (Difference of squares basically)
Are there any more? I find that method 2 is pretty much what I use, and perhaps the most efficient, altough using method 3 may be beneficial sometimes. Also are there more efficient ones?