What is the largest number which divides both and ?
Show answer & solutionHide answer & solution
Option C
Approach
The largest common divisor is the HCF, and the HCF of and follows the same Euclid steps as the exponents and .
Step-by-step solution
- 1
Why: Write the larger exponent as . The bracket is a multiple of , so only is left as the remainder.
- 2
Why: A common divisor of the two numbers also divides the remainder. So one Euclid step on the exponents is one Euclid step on the numbers.
- 3
Why: Run Euclid's algorithm on the exponents and . The last non-zero remainder is .
- 4
Why: So the largest number dividing both is .
Shortcut
Remember and read off .
Common mistakes
Option A
Took the HCF of the exponents' neighbours: instead of .
Option B
Took , a number built from the exponent and not from a power of .
Option D
Used instead of .
Skills used