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>
43 lines
948 B
Markdown
43 lines
948 B
Markdown
---
|
|
id: 5900f3f21000cf542c50ff05
|
|
title: 'Problem 134: Prime pair connection'
|
|
challengeType: 5
|
|
forumTopicId: 301762
|
|
dashedName: problem-134-prime-pair-connection
|
|
---
|
|
|
|
# --description--
|
|
|
|
Consider the consecutive primes p1 = 19 and p2 = 23. It can be verified that 1219 is the smallest number such that the last digits are formed by p1 whilst also being divisible by p2.
|
|
|
|
In fact, with the exception of p1 = 3 and p2 = 5, for every pair of consecutive primes, p2 > p1, there exist values of n for which the last digits are formed by p1 and n is divisible by p2. Let S be the smallest of these values of n.
|
|
|
|
Find ∑ S for every pair of consecutive primes with 5 ≤ p1 ≤ 1000000.
|
|
|
|
# --hints--
|
|
|
|
`euler134()` should return 18613426663617120.
|
|
|
|
```js
|
|
assert.strictEqual(euler134(), 18613426663617120);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler134() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler134();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|