79d9012432
* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
63 lines
1.2 KiB
Markdown
63 lines
1.2 KiB
Markdown
---
|
|
id: 5900f4b01000cf542c50ffc2
|
|
challengeType: 5
|
|
title: 'Problem 323: Bitwise-OR operations on random integers'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
Let y0, y1, y2,... be a sequence of random unsigned 32 bit integers
|
|
(i.e. 0 ≤ yi < 232, every value equally likely).
|
|
For the sequence xi the following recursion is given:x0 = 0 and
|
|
xi = xi-1| yi-1, for i > 0. ( | is the bitwise-OR operator)
|
|
It can be seen that eventually there will be an index N such that xi = 232 -1 (a bit-pattern of all ones) for all i ≥ N.
|
|
|
|
Find the expected value of N.
|
|
Give your answer rounded to 10 digits after the decimal point.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler323()</code> should return 6.3551758451.
|
|
testString: assert.strictEqual(euler323(), 6.3551758451, '<code>euler323()</code> should return 6.3551758451.');
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler323() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler323();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|