# Sylvester's Postage Stamp Problem

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

What is the greatest positive integer such that the Diophantine equation has no solution in non-negative integers? If and are relatively prime numbers, the equation has a solution in integers for any integer and has a solution in non-negative integers for any integer greater than .

Contributed by: Izidor Hafner (December 2012)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

J. J. Sylvester (1814–1897) posed the problem of finding the largest number that cannot be made up of some combination of 5p and 17p stamps.

Reference

[1] D. Wells, *The Penguin Book of Curious and Interesting Puzzles*, New York: Penguin Books, 1993 p. 64.

## Permanent Citation

"Sylvester's Postage Stamp Problem"

http://demonstrations.wolfram.com/SylvestersPostageStampProblem/

Wolfram Demonstrations Project

Published: December 7 2012