olymmath

Putnam 1995 A3

  • Session A

The number d1d2…d9d_{1}d_{2}\dots d_{9} has nine (not necessarily distinct) decimal digits. The number e1e2…e9e_{1}e_{2}\dots e_{9} is such that each of the nine 9-digit numbers formed by replacing just one of the digits did_{i} is d1d2…d9d_{1}d_{2}\dots d_{9} by the corresponding digit eie_{i} (1≤i≤91 \leq i \leq 9) is divisible by 7. The number f1f2…f9f_{1}f_{2}\dots f_{9} is related to e1e2…e9e_{1}e_{2}\dots e_{9} is the same way: that is, each of the nine numbers formed by replacing one of the eie_{i} by the corresponding fif_{i} is divisible by 7. Show that, for each ii, di−fid_{i}-f_{i} is divisible by 7. [For example, if d1d2…d9=199501996d_{1}d_{2}\dots d_{9} = 199501996, then e6e_{6} may be 2 or 9, since 199502996199502996 and 199509996199509996 are multiples of 7.]

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Kiran Kedlaya

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1995/a3 · Tag T7TNN1TT8F · Edit this page on GitHub · Keys: j next, k previous