This is in the spirit of the What is a Word/Phrase™ series started by JLee with a special brand of Phrase™ and Word™ puzzles.
If a word conforms to a special rule, I call it a Stable Word™.
Use the following examples below to find the rule.
Stable words™ | Non-Stable words™ |
---|---|
even | odd |
acidic | alkaline |
transparent | opaque |
uniqueness | repetition |
movableness | mobility |
concoction | mixture |
explode | implode |
trademark | protected |
Chinese | Japanese |
rare | common |
cyclic | acyclic |
dared | Scandinavianism |
Aaronsburg | Canada |
alternate | algorithm |
And, if you want to analyze, here is a CSV version:
Stable words™,Non-Stable words™
even,odd
acidic,alkaline
transparent,opaque
uniqueness,repetition
movableness,mobility
concoction,mixture
explode,implode
trademark,protected
Chinese,Japanese
rare,common
cyclic,acyclic
dared,Scandinavianism
Aaronsburg,Canada
alternate,algorithm
The puzzle relies on the series' inbuilt assumption, that each word can be tested for whether it is a Stable Word™ without relying on the other words.
These are not the only examples of Stable Words™, many more exist and can be found.
Hint #1
Words that have a certain simple property are automatically disqualified from being Stable Words™. There are four such words on the provided list of Non-Stable Words™, and here are three more:
imply, provide, adjust
Hint #2
Don't tackle the whole word at once, rather look at it a few letters at a time.