freeCodeCamp/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md

id	title	challengeType	forumTopicId	dashedName
5900f49b1000cf542c50ffae	Problem 303: Multiples with small digits	5	301957	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.

assert.strictEqual(euler303(), 1111981904675169);

--seed--

--seed-contents--

function euler303() {

  return true;
}

euler303();

--solutions--

// solution required