Show that every set containing 76 distinct, positive integers, each of
which is less than 1000 must contain a pair of numbers (a > b), so
that a - b can be computed without "borrowing".
Note: 735 - 532 can be computed without borrowing, but 735 - 538 cannot.
This month's prize will be award to the best explained, correct solution.
Submit your solution to the Mathematics Undergraduate Office (Math P-142)
or electronically to Prof. Kudzin at
problem@math.sunysb.edu
by the due date. Acceptable electronic formats are: PDF, Postscript, DVI,
(La)TeX, or just plain text. Please include your name and phone number,
or preferably your email address.