Consider the word UNGRATEFUL. By erasing the 2 first letters we get GRATEFUL, by erasing 7 letters ATE, erasing 6 letters might create RATE or GATE, but not FATE, because our procedure does not allow changing the sequential order of the letters in the original word.

Now in our puzzle your task is to apply the above procedure to each of the words in "AMERICAN PROSPEROUS BUSINESSMAN", complying with the following rules:
1. In an n-letter word you are allowed to erase 1 to n-2 letters.
2. All words, common and proper nouns, all forms of verbs, confirmed by Google search are allowed.
3. No word might be repeated (e.g. like MAN in our case).
4. No abbreviations like USA, IOU, NB etc.
5. Plural form is ok.
6. For each of the 3 words count the total number of letters in the newly created list, call the result CA, CP, and CB.
7. You aim to get a maximal product CA*CP*CB.

Publish both your lists of words and the final score.

CA*CP*CB = (544-6)*(520-18)*190 = 51,314,440

Posted by K Sengupta on 2024-06-19 08:53:26