Puzzling Asked by Jack Pettinger on June 30, 2021
This puzzle is based off the What is a Word™ and What is a Phrase™ series started by JLee and their spin-off What is a Number™ series.
If a word conforms to a certain rule, I call it a Complete Word™. Use the following examples to find the rule:
| Complete Words™ | Not Complete Words™ |
|---|---|
| Ben | Bill |
| Beat | Slap |
| Geek | Nerd |
| Abbey | Church |
| Aching | Tiring |
| Balding | Receding |
| Abdicating | Renouncing |
CSV version:
Complete Words™, Not Complete Words™
Ben,Bill
Beat,Slap
Geek,Nerd
Abbey,Church
Aching,Tiring
Balding,Receding
Abdicating,Renouncing
These aren’t the only Complete Words™, there are others that exist.
As a bonus, (when it’s possible to do so) I will award a bounty to the person that finds the longest Complete Word. This must be a real word (in English). The bounty will be awarded 24 hours after the accepted answer.
If I’m not allowed to do the above, please tell me to edit.
Edit: Correct answer has been identified and accepted at 22:45 GMT 7th March 2018.
A Complete Word satisfies the property that
Examples
Bonus suggestion
Apologies for the edits, I made several incorrect calculations before arriving at the answer.
Correct answer by hexomino on June 30, 2021
The set of complete words is a closed. So, a complete word plus another complete word is also a complete word. We can thus construct words from other words. For instance geekabdicating is one such word, which probably is not accepted as a solution. If we restrict ourselves to dictionary words
Answered by Carl Löndahl on June 30, 2021
If hexomino's answer is correct, I would guess one of these being the longest Complete Word™:
A slightly shorter, but much more common, Complete Word™ is:
Answered by bewilderex63 on June 30, 2021
Get help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP