gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
7e9b51bfb9c363c9252f40d5242a9f463944e41f
freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-291-panaitopol-primes.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828) 
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

823 B
Raw Blame History

id, challengeType, title
id challengeType title
5900f48f1000cf542c50ffa2 5 Problem 291: Panaitopol Primes

Description

A prime number p is called a Panaitopol prime if for some positive integersx and y.

Find how many Panaitopol primes are less than 5×1015.

Instructions

Tests

tests:
  - text: <code>euler291()</code> should return 4037526.
    testString: assert.strictEqual(euler291(), 4037526, '<code>euler291()</code> should return 4037526.');

Challenge Seed

function euler291() {
  // Good luck!
  return true;
}

euler291();

Solution

// solution required