1.8 KiB
1.8 KiB
id | challengeType | title |
---|---|---|
5900f4ba1000cf542c50ffcd | 5 | Problem 334: Spilling the beans |
Description
For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game:
You are given the following sequences: t0 = 123456.
ti =
ti-12
,
if ti-1 is even
ti-12
926252,
if ti-1 is odd
where ⌊x⌋ is the floor function
and is the bitwise XOR operator.
bi = ( ti mod 211) + 1.
The first two terms of the last sequence are b1 = 289 and b2 = 145. If we start with b1 and b2 beans in two adjacent bowls, 3419100 moves would be required to finish the game.
Consider now 1500 adjacent bowls containing b1, b2,..., b1500 beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.
Instructions
Tests
tests:
- text: <code>euler334()</code> should return 150320021261690850.
testString: assert.strictEqual(euler334(), 150320021261690850, '<code>euler334()</code> should return 150320021261690850.');
Challenge Seed
function euler334() {
// Good luck!
return true;
}
euler334();
Solution
// solution required