1984 AIME Problems/Problem 2: Difference between revisions
I_like_pie (talk | contribs) No edit summary |
No edit summary |
||
| 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>. | |||
== Solution == | == Solution == | ||
{{solution}} | {{solution}} | ||
Revision as of 22:38, 20 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.
