freeCodeCamp/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.english.md at 81a0c0c8e07a6c3a4f99228a8af10967fa0c53d9

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.2 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4351000cf542c50ff47	5	Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"

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

Instructions

Tests

tests:
  - text: <code>euler200()</code> should return 229161792008.
    testString: assert.strictEqual(euler200(), 229161792008, '<code>euler200()</code> should return 229161792008.');

Challenge Seed

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

euler200();

Solution

// solution required

1.2 KiB Raw Blame History