* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
		
			
				
	
	
		
			49 lines
		
	
	
		
			1.2 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			49 lines
		
	
	
		
			1.2 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | |
| id: 5900f39f1000cf542c50feb2
 | |
| title: 'Problem 51: Prime digit replacements'
 | |
| challengeType: 5
 | |
| forumTopicId: 302162
 | |
| dashedName: 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.
 | |
| 
 | |
| # --hints--
 | |
| 
 | |
| `primeDigitReplacements()` should return a number.
 | |
| 
 | |
| ```js
 | |
| assert(typeof primeDigitReplacements() === 'number');
 | |
| ```
 | |
| 
 | |
| `primeDigitReplacements()` should return 121313.
 | |
| 
 | |
| ```js
 | |
| assert.strictEqual(primeDigitReplacements(), 121313);
 | |
| ```
 | |
| 
 | |
| # --seed--
 | |
| 
 | |
| ## --seed-contents--
 | |
| 
 | |
| ```js
 | |
| function primeDigitReplacements() {
 | |
| 
 | |
|   return true;
 | |
| }
 | |
| 
 | |
| primeDigitReplacements();
 | |
| ```
 | |
| 
 | |
| # --solutions--
 | |
| 
 | |
| ```js
 | |
| // solution required
 | |
| ```
 |