From charlesreid1

(Created page with "Examples: <code>*3</code> <code>56**3</code> Note that the problem does not specify number of *s that should be in final answer, so you should not assume 2.")
 
m (Replacing charlesreid1.com:3000 with git.charlesreid1.com)
 
(3 intermediate revisions by the same user not shown)
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
 
==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==
 
{{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