From charlesreid1

No edit summary
Line 1: Line 1:
Examples:
==Problem Description==


<code>*3</code>
Prime digit replacement: https://projecteuler.net/problem=51


<code>56**3</code>
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.


Note that the problem does not specify number of *s that should be in final answer, so you should not assume 2.
Example: 56**3
 
Example: *3
 
==Code==
 
https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/051
 
==Flags==
 
{{ProjectEulerFlag}}

Revision as of 09:11, 8 January 2018

Problem Description

Prime digit replacement: https://projecteuler.net/problem=51

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.

Example: 56**3

Example: *3

Code

https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/051

Flags