Home > Mathematica, Mathematics > Climbing the lattice

Climbing the lattice

I have seen a lot of references to Sylvester’s stamp puzzle or problem. Here is a statement and it’s solution.

Fundamentally, it illustrates a property of relatively prime numbers.

For, p,q relatively prime numbers, there exist a, b \in \mathbf{Z} such that:

a p +b q =1. Consequently, any integer can by choosing suitable a, b. The problem constrains the solutions to the first octant. There are is a maximum integer that has no solution in this octant: pq -p-q.

If there stamp denominations are not relatively prime then there are an infinite number of ‘gaps’, hence no finite maximum.

The CDF here is motivated by this puzzle (for denominations 4 and 7).

Categories: Mathematica, Mathematics
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: