Project Euler/51: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
Example: *3 | Example: *3 | ||
==Solution== | |||
My solution was written in Java; extensive thoughts and notes here: https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/051 | |||
Note that the wording of this problem is a bit tricky... | |||
==Code== | ==Code== | ||
Revision as of 09:12, 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
Solution
My solution was written in Java; extensive thoughts and notes here: https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/051
Note that the wording of this problem is a bit tricky...
Code
https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/051
Flags
