gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Feat: add new Markdown parser (#39800)

Browse Source 
and change all the challenges to new `md` format.
This commit is contained in:
Oliver Eyton-Williams
2020-11-27 19:02:05 +01:00
committed by GitHub
parent a07f84c8ec
commit 0bd52f8bd1
2580 changed files with 113436 additions and 111979 deletions
Download Patch File Download Diff File Expand all files Collapse all files

45
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
View File

@ -1,43 +1,29 @@
---
id: 5900f4a01000cf542c50ffb2
challengeType: 5
title: 'Problem 307: Chip Defects'
challengeType: 5
forumTopicId: 301961
---
## Description
<section id='description'>
# --description--
k defects are randomly distributed amongst n integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).
Let p(k,n) represent the probability that there is a chip with at least 3 defects.
For instance p(3,7) ≈ 0.0204081633.
Let p(k,n) represent the probability that there is a chip with at least 3 defects. For instance p(3,7) ≈ 0.0204081633.
Find p(20 000, 1 000 000) and give your answer rounded to 10 decimal places in the form 0.abcdefghij
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler307()</code> should return 0.7311720251.
testString: assert.strictEqual(euler307(), 0.7311720251);
`euler307()` should return 0.7311720251.
```js
assert.strictEqual(euler307(), 0.7311720251);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler307() {
@ -48,17 +34,8 @@ function euler307() {
euler307();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>