# Problem: The Four Postage Stamps

"It is as easy as counting," is an expression one sometimes hears. But mere counting may be puzzling at times. Take the following simple example. Suppose you have just bought twelve postage stamps, in this form — three by four — and a friend asks you to oblige him with four stamps, all joined together — no stamp hanging on by a mere corner. In how many different ways is it possible for you to tear off those four stamps? You see, you can give him $1, 2, 3, 4,$ or $2, 3, 6, 7,$ or $1, 2, 3, 6,$ or $1, 2, 3, 7,$ or $2, 3, 4, 8,$ and so on. Can you count the number of different ways in which those four stamps might be delivered? There are not many more than fifty ways, so it is not a big count. Can you get the exact number?

Solutions: 1

Thank you to the contributors under CC BY-SA 4.0!

Github:

non-Github:
@H-Dudeney

### References

#### Project Gutenberg

1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.