---
id: 5900f49b1000cf542c50ffae
title: 'Problem 303: Multiples with small digits'
challengeType: 5
forumTopicId: 301957
dashedName: problem-303-multiples-with-small-digits
---

# --description--

For a positive integer n, define f(n) as the least positive multiple of n that, written in base 10, uses only digits ≤ 2.

Thus f(2)=2, f(3)=12, f(7)=21, f(42)=210, f(89)=1121222.

Also, .

Find .

# --hints--

`euler303()` should return 1111981904675169.

```js
assert.strictEqual(euler303(), 1111981904675169);
```

# --seed--

## --seed-contents--

```js
function euler303() {

  return true;
}

euler303();
```

# --solutions--

```js
// solution required
```
