Oliver Eyton-Williams 0bd52f8bd1

and change all the challenges to new `md` format.

2020-11-27 10:02:05 -08:00

id, title, challengeType, forumTopicId

id	title	challengeType	forumTopicId
5900f49b1000cf542c50ffae	Problem 303: Multiples with small digits	5	301957

--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.

assert.strictEqual(euler303(), 1111981904675169);

function euler303() {

  return true;
}

euler303();

// solution required