alleryWhich method finds the greatest common divisor of two integers?
ACross cancellation
BLong multiplication
CEuclidean algorithm
DDigit rounding up
Answer & Solution
Correct answer: C. Euclidean algorithm
1. We need a method to find the largest shared factor of two integers.
2. The Euclidean algorithm does exactly this.
3. Long multiplication, cross cancellation and rounding are not methods for finding a gcd.
_Source: Wikipedia, Fraction, section Simplifying (reducing) fractions_
Keep practising Fractions
Browse all Fractions questions for CTET, or explore more Mathematics topics.
Related questions
Decimal numerals approximate every real number to how much accuracy?Which statement about 3.14 and pi is true?In which century did positional decimal fractions first appear in an Arab book?Which mathematician's 5th century work gave a 7-digit approximation of pi?Which Persian mathematician advanced decimal fractions in the 15th century?Who introduced decimal fractions in the booklet De Thiende (1585)?Which symbols can be a decimal separator depending on locale?What is the dot in 25.9703 called?