Privacy Policy

Terms & Conditions

See Details This website uses cookies. By using this website you are accepting the use of cookies. For more information please view the privacy policy.
The Miller next took the company aside and showed them nine sacks of flour that were standing as depicted in the sketch.
"Now, hearken, all and some," said he, "while that I do set ye the riddle of the nine sacks of flour.
And mark ye, my lords and masters, that there be single sacks on the outside, pairs next unto them, and three together in the middle thereof.
By Saint Benedict, it doth so happen that if we do but multiply the pair, 28, by the single one, 7, the answer is 196, which is of a truth the number shown by the sacks in the middle.
Yet it be not true that the other pair, 34, when so multiplied by its neighbour, 5, will also make 196.
Wherefore I do beg you, gentle sirs, so to place anew the nine sacks with as little trouble as possible that each pair when thus multiplied by its single neighbour shall make the number in the middle."
As the Miller has stipulated in effect that as few bags as possible shall be moved, there is only one answer to this puzzle, which everybody should be able to solve.
[Puzzle Code = ZYIT] The Miller's Puzzle. The Canterbury Puzzles And Other Curious Problems by Henry Ernest Dudeney (1907).
Direct Link: www.brainbashers.com?ZYIT
Hint: The two left numbers multiplied, or the right two numbers, should create the central number.
Answer:
The way to arrange the sacks of flour is as follows: 2, 78, 156, 39, 4. Here each pair when multiplied by its single neighbour makes the number in the middle, and only five of the sacks need be moved.
There are just three other ways in which they might have been arranged (4, 39, 156, 78, 2; or 3, 58, 174, 29, 6; or 6, 29, 174, 58, 3), but they all require the moving of seven sacks.
Puzzle 19
Below you will find 15 wellknown five letter words, with only their endings remaining. Can you determine the words?
BrainBashers™ is a trademark. This website uses cookies. By using this website you are accepting the use of cookies. For more information please view the privacy policy. By using this website you are also agreeing to the terms and conditions.