Let's substitute each letter of a given word by the value of its ordinal count in the ABC: A=>1, B==>2 .. Z==>26.
Evaluate the total for that word and call it f(k), k being the number of letters in the word.
Let MW(K) be a word for which f(k) is minimal.

Example: assuming the word CAB generates the lowest f(3) then MW(3) is CAB and its f(3)=6.

Question: What triplet of common English words will generate the lowest f(7)+f(9)+ f(11)?

What is a common word is subjective. This does not mean it can not
be narrowed with further limiting and precise definition. If defined as a word permitted to use from the collection of English word lists that where at least one is valid for use and play in an official tournament for a popular word board game, the lowest f(7)+f(9)+f(11) total that I found is 102.

 20 CACHACA     - a Brazilian white rum
 30 BECCACCIA   - a woodcock
 52 ABRACADABRA - an incantation; nonsense
===
102

My word list is a combination of the World English word lists and that of the North American English word lists.

Edited on October 24, 2017, 6:07 am

Posted by Dej Mar on 2017-10-23 02:52:40