Files
gikf a2b2ef3f75 fix(curriculum): clean-up Project Euler 441-460 (#43068)
* fix: clean-up Project Euler 441-460

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
2021-07-30 08:20:31 -07:00

850 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f5271000cf542c510039 Problem 442: Eleven-free integers 5 302114 problem-442-eleven-free-integers

--description--

An integer is called eleven-free if its decimal expansion does not contain any substring representing a power of 11 except 1.

For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.

Let E(n) be the $n$th positive eleven-free integer. For example, E(3) = 3, E(200) = 213 and E(500\\,000) = 531\\,563.

Find E({10}^{18}).

--hints--

elevenFreeIntegers() should return 1295552661530920200.

assert.strictEqual(elevenFreeIntegers(), 1295552661530920200);

--seed--

--seed-contents--

function elevenFreeIntegers() {

  return true;
}

elevenFreeIntegers();

--solutions--

// solution required