Difference between revisions of "1984 AIME Problems/Problem 2"
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | The integer <math>n</math> is the smallest positive multiple of <math>15</math> such that every digit of <math>n</math> is either <math>8</math> or <math>0</math>. Compute <math>\frac{n}{15}</math>. | + | The integer <math>\displaystyle n</math> is the smallest positive multiple of <math>\displaystyle 15</math> such that every digit of <math>\displaystyle n</math> is either <math>\displaystyle 8</math> or <math>\displaystyle 0</math>. Compute <math>\frac{n}{15}</math>. |
== Solution == | == Solution == | ||
Revision as of 00:22, 21 January 2007
Problem
The integer 
is the smallest positive multiple of 
such that every digit of is either 
or 
. Compute 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
