59 lines
1.1 KiB
Markdown
59 lines
1.1 KiB
Markdown
---
|
|
id: 5900f3f21000cf542c50ff05
|
|
challengeType: 5
|
|
title: 'Problem 134: Prime pair connection'
|
|
---
|
|
|
|
## Description
|
|
<section id='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.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler134()</code> should return 18613426663617120.
|
|
testString: assert.strictEqual(euler134(), 18613426663617120);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler134() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler134();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|