*Problem #3*

Let *A*_{n} denote the set of all 2*n* digit numbers
whose decimal representation conisists of exactly *n* 1's and
*n* 0's. (Note: The leading digit must be a 1.) It is not too
difficult to show that there must be at least one number in
*A*_{n} that is evenly divisible by *n*. This month's
problem is to determine the fraction of elements of *A*_{n}
that are divisible by *n* for *n* = 1,2,...,12.

**
The solution will be posted shortly.
**

Back to the Archives

Back to the Math Department Homepage.