Free puzzles / Question / Combination and Group Problems
Fifteen Letter Puzzle.
ALE FOE HOD BGN
CAB HEN JOG KFM
HAG GEM MOB BFH
FAN KIN JEK DFL
JAM HIM GCL LJH
AID JIB FCJ NJD
OAK FIG HCK MLN
BED OIL MCD BLK
ICE CON DGK
The above is the solution of a puzzle I gave in _Tit-bits_ in the summer
of 1896. It was required to take the letters, A, B, C, D, E, F, G, H, I,
J, K, L, M, N, and O, and with them form thirty-five groups of three
letters so that the combinations should include the greatest number
possible of common English words. No two letters may appear together in
a group more than once. Thus, A and L having been together in ALE, must
never be found together again; nor may A appear again in a group with E,
nor L with E. These conditions will be found complied with in the above
solution, and the number of words formed is twenty-one. Many persons
have since tried hard to beat this number, but so far have not
succeeded.
More than thirty-five combinations of the fifteen letters cannot be
formed within the conditions. Theoretically, there cannot possibly be
more than twenty-three words formed, because only this number of
combinations is possible with a vowel or vowels in each. And as no
English word can be formed from three of the given vowels (A, E, I, and
O), we must reduce the number of possible words to twenty-two. This is
correct theoretically, but practically that twenty-second word cannot be
got in. If JEK, shown above, were a word it would be all right; but it
is not, and no amount of juggling with the other letters has resulted in
a better answer than the one shown. I should, say that proper nouns and
abbreviations, such as Joe, Jim, Alf, Hal, Flo, Ike, etc., are
disallowed.
Now, the present puzzle is a variation of the above. It is simply this:
Instead of using the fifteen letters given, the reader is allowed to
select any fifteen different letters of the alphabet that he may prefer.
Then construct thirty-five groups in accordance with the conditions, and
show as many good English words as possible.
Answer
The boys can walk out as follows:--
1st Day. 2nd Day. 3rd Day.
A B C B F H F A G
D E F E I A I D B
G H I C G D H C E
4th Day. 5th Day. 6th Day.
A D H G B I D C A
B E G C F D E H B
F I C H A E I G F
Every boy will then have walked by the side of every other boy once and
once only.
Dealing with the problem generally, 12n+9 boys may walk out in triplets
under the conditions on 9n+6 days, where n may be nought or any integer.
Every possible pair will occur once. Call the number of boys m. Then
every boy will pair m-1 times, of which (m-1)/4 times he will be in the
middle of a triplet and (m-1)/2 times on the outside. Thus, if we refer
to the solution above, we find that every boy is in the middle twice
(making 4 pairs) and four times on the outside (making the remaining 4
pairs of his 8). The reader may now like to try his hand at solving the
two next cases of 21 boys on 15 days, and 33 boys on 24 days. It is,
perhaps, interesting to note that a school of 489 boys could thus walk
out daily in one leap year, but it would take 731 girls (referred to in
the solution to No. 269) to perform their particular feat by a daily
walk in a year of 365 days.