Files
gikf 47fc3c6761 fix(curriculum): clean-up Project Euler 281-300 (#42922)
* fix: clean-up Project Euler 281-300

* fix: missing image extension

* fix: missing power

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

* fix: missing subscript

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

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
2021-07-22 12:38:46 +09:00

650 B
Raw Permalink Blame History

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f48f1000cf542c50ffa2 Problem 291: Panaitopol Primes 5 301943 problem-291-panaitopol-primes

--description--

A prime number p is called a Panaitopol prime if p = \frac{x^4 - y^4}{x^3 + y^3} for some positive integers x and y.

Find how many Panaitopol primes are less than 5 × {10}^{15}.

--hints--

panaitopolPrimes() should return 4037526.

assert.strictEqual(panaitopolPrimes(), 4037526);

--seed--

--seed-contents--

function panaitopolPrimes() {

  return true;
}

panaitopolPrimes();

--solutions--

// solution required