1.3 KiB
1.3 KiB
id | challengeType | title |
---|---|---|
5900f4931000cf542c50ffa4 | 5 | Problem 293: Pseudo-Fortunate Numbers |
Description
If N is admissible, the smallest integer M > 1 such that N+M is prime, will be called the pseudo-Fortunate number for N.
For example, N=630 is admissible since it is even and its distinct prime factors are the consecutive primes 2,3,5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is M=11. It can also be seen that the pseudo-Fortunate number for 16 is 3.
Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N less than 109.
Instructions
Tests
tests:
- text: <code>euler293()</code> should return 2209.
testString: assert.strictEqual(euler293(), 2209, '<code>euler293()</code> should return 2209.');
Challenge Seed
function euler293() {
// Good luck!
return true;
}
euler293();
Solution
// solution required