Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I need to find the prime factorization of a number having 30 digits.

I used the Pollard rho method but unfortunately it is not sufficient enough.

It needs a more advanced prime factorization process. Please Help.

share|cite|improve this question
You refer to a problem in a set of online math challenges. I don't know whether the file of test cases I'd get from the site would agree with the one you got. Perhaps you should narrow your question a bit. – hardmath Feb 8 '13 at 19:50
edit out the bit about SPOJ and just say you need to factor 30 digit numbers in <time> on average. – user58512 Feb 8 '13 at 19:52
Okay, maybe have a look at these Prime Factorization Algorithms Regards – Amzoti Feb 8 '13 at 19:55
thanks for response – palatok Feb 8 '13 at 19:56
up vote 4 down vote accepted

This applet factorizes numbers using the elliptic curve method. It factors $30$ digit numbers almost instantly.

share|cite|improve this answer

Use PARI/GP which can factor numbers of that size in a fraction of a second.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.