HANNAH'S PUZZLE

A man was in love with a young lady whose Christian name was Hannah. When he asked her to be his wife she wrote down the letters of her name in this manner:— and promised that she would be his if he could tell her correctly in how many different ways it was possible to spell out her name, always passing from one letter to another that was adjacent. Diagonal steps are here allowed. Whether she did this merely to tease him or to test his cleverness is not recorded, but it is satisfactory to know that he succeeded. Would you have been equally successful? Take your pencil and try. You may start from any of the H's and go backwards or forwards and in any direction, so long as all the letters in a spelling are adjoining one another. How many ways are there, no two exactly alike?

主题:
组合数学 -> 案例分析/检查案例 -> 过程/程序
来源:
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in