* fix: clean-up Project Euler 241-260 * fix: typo * Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
812 B
812 B
id, title, challengeType, forumTopicId, dashedName
id | title | challengeType | forumTopicId | dashedName |
---|---|---|---|---|
5900f4671000cf542c50ff7a | Problem 251: Cardano Triplets | 5 | 301899 | problem-251-cardano-triplets |
--description--
A triplet of positive integers (a
,$b$,$c$) is called a Cardano Triplet if it satisfies the condition:
\sqrt[3]{a + b \sqrt{c}} + \sqrt[3]{a - b \sqrt{c}} = 1
For example, (2,1,5) is a Cardano Triplet.
There exist 149 Cardano Triplets for which a + b + c ≤ 1000
.
Find how many Cardano Triplets exist such that a + b + c ≤ 110\\,000\\,000
.
--hints--
cardanoTriplets()
should return 18946051
.
assert.strictEqual(cardanoTriplets(), 18946051);
--seed--
--seed-contents--
function cardanoTriplets() {
return true;
}
cardanoTriplets();
--solutions--
// solution required