Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory intermediate

Problem

Find the greatest common factor of and
Solution
By the Euclidean algorithm for computing greatest common factors, we have Applying the Euclidean algorithm again, we get Recognizing 429 as , we conclude that the greatest common factor of 1001 and 2431 is
Final answer
143