freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.english.md

id	challengeType	title	forumTopicId
5900f4b01000cf542c50ffc2	5	Problem 323: Bitwise-OR operations on random integers	301980

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.

Instructions

Tests

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

Challenge Seed

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

euler323();

Solution

// solution required