freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.english.md

id, challengeType, title

id	challengeType	title
5900f39f1000cf542c50feb2	5	Problem 51: Prime digit replacements

Description

By replacing the 1st digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime. By replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property. Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family.

Instructions

Tests

tests:
  - text: <code>euler51()</code> should return 121313.
    testString: 'assert.strictEqual(euler51(), 121313, "<code>euler51()</code> should return 121313.");'

Challenge Seed

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

euler51();

Solution

// solution required