Example 1 — Distinct letters in a word
EasyProblem
Write the set of distinct letters in the word 'BANANA' as a set.
Solution
-
We want which letters appear, not order or how many times.
Name the structure before touching arithmetic — that is what makes the right method obvious.
-
Ask the recognition question: If I rearrange the items or drop a repeat, is it still the exact same object?
If the answer is yes, the concept applies; the cue, not a keyword, decides the method.
-
List each letter once, dropping repeats and ignoring position.
The rule is chosen only after the structure matches, so the steps mean something.
-
B appears, A appears (drop the extra A's), N appears (drop the extra N).
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 — a bag of distinct things, order ignored. If it does not, revisit the recognition step before changing the arithmetic.
Answer
, a 3-element set
Takeaway: A set keeps each distinct member once and ignores order.