freeCodeCamp/problem-425-prime-connection.english.md at f1c9b08cf322e4268a0a31ae9b5d75bf3cfce7d1

Files

Oliver Eyton-Williams f1c9b08cf3 fix(curriculum): add isHidden: false to challenges

This includes certificates (where it does nothing), but does not
include any translations.

2020-05-25 16:25:19 +05:30

1.4 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f5151000cf542c510028	5	false	Problem 425: Prime connection	302095

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).

Instructions

Tests

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

Challenge Seed

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

euler425();

Solution

// solution required

1.4 KiB Raw Blame History