1.4 KiB
1.4 KiB
id | challengeType | title |
---|---|---|
5900f5241000cf542c510036 | 5 | Problem 437: Fibonacci primitive roots |
Description
So the powers of 8 mod 11 are cyclic with period 10, and 8n + 8n+1 ≡ 8n+2 (mod 11). 8 is called a Fibonacci primitive root of 11. Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491. Find the sum of the primes less than 100,000,000 with at least one Fibonacci primitive root.
Instructions
Tests
tests:
- text: <code>euler437()</code> should return 74204709657207.
testString: assert.strictEqual(euler437(), 74204709657207, '<code>euler437()</code> should return 74204709657207.');
Challenge Seed
function euler437() {
// Good luck!
return true;
}
euler437();
Solution
// solution required