Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

795 B
Raw Blame History

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

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);

Challenge Seed

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

euler291();

Solution

// solution required