2018-10-10 18:03:03 -04:00
---
id: 5900f4351000cf542c50ff47
2021-02-06 04:42:36 +00:00
title: >-
Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"
2018-10-10 18:03:03 -04:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 301840
2021-01-13 03:31:00 +01:00
dashedName: >-
problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
2018-10-10 18:03:03 -04:00
---
2020-12-16 00:37:30 -07:00
# --description--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
We shall define a sqube to be a number of the form, p2q3, where p and q are distinct primes.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
For example, 200 = 5223 or 120072949 = 232613.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
The first five squbes are 72, 108, 200, 392, and 500.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
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".
2018-10-10 18:03:03 -04:00
2020-12-16 00:37:30 -07:00
# --hints--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
`euler200()` should return 229161792008.
2018-10-10 18:03:03 -04:00
```js
2020-12-16 00:37:30 -07:00
assert.strictEqual(euler200(), 229161792008);
2018-10-10 18:03:03 -04:00
```
2021-01-13 03:31:00 +01:00
# --seed--
## --seed-contents--
```js
function euler200() {
return true;
}
euler200();
```
2020-12-16 00:37:30 -07:00
# --solutions--
2020-08-13 17:24:35 +02:00
2021-01-13 03:31:00 +01:00
```js
// solution required
```