Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
Oliver Eyton-Williams 0bd52f8bd1 Feat: add new Markdown parser (#39800)
and change all the challenges to new `md` format.
2020-11-27 10:02:05 -08:00

807 B
Raw Blame History

id, title, challengeType, forumTopicId
id title challengeType forumTopicId
5900f4491000cf542c50ff5c Problem 221: Alexandrian Integers 5 301864

--description--

We shall call a positive integer A an "Alexandrian integer", if there exist integers p, q, r such that: A = p · q · r and 1/A = 1/p + 1/q + 1/r

For example, 630 is an Alexandrian integer (p = 5, q = 7, r = 18). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.

Find the 150000th Alexandrian integer.

--hints--

euler221() should return 1884161251122450.

assert.strictEqual(euler221(), 1884161251122450);

--seed--

--seed-contents--

function euler221() {

  return true;
}

euler221();

--solutions--

// solution required