Project Euler/51: Difference between revisions
From charlesreid1
No edit summary |
m (Replacing charlesreid1.com:3000 with git.charlesreid1.com) |
||
| Line 11: | Line 11: | ||
==Solution== | ==Solution== | ||
My solution was written in Java; extensive thoughts and notes here: https://charlesreid1.com | 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... | Note that the wording of this problem is a bit tricky... | ||
| Line 17: | Line 17: | ||
==Code== | ==Code== | ||
https://charlesreid1.com | https://git.charlesreid1.com/cs/euler/src/master/scratch/Round2_050-070/051 | ||
==Flags== | ==Flags== | ||
{{ProjectEulerFlag}} | {{ProjectEulerFlag}} | ||
Latest revision as of 03:47, 9 October 2019
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
