65 lines
1.2 KiB
Markdown
65 lines
1.2 KiB
Markdown
---
|
|
id: 5900f4351000cf542c50ff47
|
|
challengeType: 5
|
|
title: 'Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"'
|
|
forumTopicId: 301840
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
We shall define a sqube to be a number of the form, p2q3, where p and q are distinct primes.
|
|
For example, 200 = 5223 or 120072949 = 232613.
|
|
|
|
The first five squbes are 72, 108, 200, 392, and 500.
|
|
|
|
Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string "200" is 1992008.
|
|
|
|
Find the 200th prime-proof sqube containing the contiguous sub-string "200".
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler200()</code> should return 229161792008.
|
|
testString: assert.strictEqual(euler200(), 229161792008);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler200() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler200();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|