Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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 want a very quick non recursive method for finding the HCF (Highest Common Factor) of 2 very large numbers

share|cite|improve this question
    
How large are your very large numbers? – TonyK Feb 11 '11 at 21:13
    
Consider the both the numbers to be a 100 digits in length each (both are integers ofcourse) – Pushpak Dagade Feb 12 '11 at 6:36

For example, http://www.lysator.liu.se/~nisse/archive/sgcd.pdf gives a discussion of sub-quadratic methods for finding the GCD (in particular Schoenhage's algorithm.)

share|cite|improve this answer

Your Answer

 
discard

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.