The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » alt.math.undergrad

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Prime Factorization
Replies: 2   Last Post: Nov 27, 1996 7:04 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Scott Phung

Posts: 32
Registered: 12/6/04
Prime Factorization
Posted: Oct 27, 1996 1:18 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.