Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-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

1.1 KiB

id, challengeType, title, forumTopicId
id challengeType title forumTopicId
5900f45c1000cf542c50ff6e 5 Problem 239: Twenty-two Foolish Primes 301884

Description

A set of disks numbered 1 through 100 are placed in a line in random order.

What is the probability that we have a partial derangement such that exactly 22 prime number discs are found away from their natural positions? (Any number of non-prime disks may also be found in or out of their natural positions.)

Give your answer rounded to 12 places behind the decimal point in the form 0.abcdefghijkl.

Instructions

Tests

tests:
  - text: <code>euler239()</code> should return 0.001887854841.
    testString: assert.strictEqual(euler239(), 0.001887854841);

Challenge Seed

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

euler239();

Solution

// solution required