Project Euler/51
From charlesreid1
Contents
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
Solution
My solution was written in Java; extensive thoughts and notes here: https://git.charlesreid1.com/cs/euler/src/master/scratch/Round2_050-070/051
Note that the wording of this problem is a bit tricky...
Code
https://git.charlesreid1.com/cs/euler/src/master/scratch/Round2_050-070/051
Flags