ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
51 lines
1.1 KiB
Markdown
51 lines
1.1 KiB
Markdown
---
|
|
id: 5900f5151000cf542c510028
|
|
title: 'Problem 425: Prime connection'
|
|
challengeType: 5
|
|
forumTopicId: 302095
|
|
dashedName: problem-425-prime-connection
|
|
---
|
|
|
|
# --description--
|
|
|
|
Two positive numbers A and B are said to be connected (denoted by "A ↔ B") if one of these conditions holds:
|
|
|
|
(1) A and B have the same length and differ in exactly one digit; for example, 123 ↔ 173.
|
|
|
|
(2) Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and 123 ↔ 23.
|
|
|
|
We call a prime P a 2's relative if there exists a chain of connected primes between 2 and P and no prime in the chain exceeds P.
|
|
|
|
For example, 127 is a 2's relative. One of the possible chains is shown below: 2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127 However, 11 and 103 are not 2's relatives.
|
|
|
|
Let F(N) be the sum of the primes ≤ N which are not 2's relatives. We can verify that F(103) = 431 and F(104) = 78728.
|
|
|
|
Find F(107).
|
|
|
|
# --hints--
|
|
|
|
`euler425()` should return 46479497324.
|
|
|
|
```js
|
|
assert.strictEqual(euler425(), 46479497324);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler425() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler425();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|