Example 1 — Find the GCF
EasyProblem
Find the GCF of and .
Solution
-
We want the largest number dividing both.
Name the structure before touching arithmetic — that is what makes the right method obvious.
-
Ask the recognition question: Am I looking for the largest number that divides every given value with no remainder?
If the answer is yes, the concept applies; the cue, not a keyword, decides the method.
-
List shared factors or use primes: , ; take the lowest power of each shared prime.
The rule is chosen only after the structure matches, so the steps mean something.
-
.
Keep units, shape, or answer form tied to the story so the work does not become symbol pushing.
-
Check the answer against the original question.
It should fit the mental model — biggest divisor shared by both. If it does not, revisit the recognition step before changing the arithmetic.
Answer
Takeaway: Take the lowest power of each shared prime for the GCF.