Find the highest common factor of
Give your answer in index form.
Notice the numbers are already factorised. Both and are handed to you as products of prime powers. That is the whole gift of this question: the hard part of an HCF — breaking each number into primes — is already done, so you must not multiply out. alone is , and factorising that back would be pointless work.
Recall the index rule for an HCF. The HCF is the largest number dividing both. A prime power divides only if is at most the exponent of in , and divides only if is at most the exponent in . So for each prime, take the smaller of the two exponents:
Line the primes up side by side. Write each number's exponent for every prime that appears, using exponent where a prime is missing:
| prime | in | in | smaller |
|---|---|---|---|
Handle the prime 11 carefully. This is where the mark is usually lost. appears in but not in , so its exponent in is and . Since , the factor drops out of the HCF entirely — an HCF can never contain a prime that only one of the numbers has.
Assemble the answer in index form.
Check by division. Multiplying out gives . Dividing: — more simply, exactly, so the HCF equals itself, which makes sense because every exponent of is at most the matching exponent of . Hence divides , and divides both.
Need to solve a different problem like this? Open the solver →