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
 |
Project Euler project euler notes
Round 1: Problems 1-20 Problem 1 · Problem 2 · Problem 3 · Problem 4 · Problem 5 · Problem 6 · Problem 7 · Problem 8 · Problem 9 · Problem 10 Problem 11 · Problem 12 · Problem 13 · Problem 14 · Problem 15 · Problem 16 · Problem 17 · Problem 18 · Problem 19 · Problem 20 Round 2: Problems 50-70 Problem 51 · Problem 52 · Problem 53 · Problem 54 · Problem 55 · Problem 56 · Problem 57 · Problem 58 · ... · Problem 61 · Problem 62 · Problem 63 · Problem 64 · Problem 65 · Problem 66 · Problem 67 Round 3: Problems 100-110 Problem 100 · Problem 101 · Problem 102 Round 4: Problems 500-510 Problem 500 · Problem 501 * · Problem 502 * Round 5: Problems 150-160 Round 6: Problems 250-260 Round 7: Problems 170-180
|