Package net.n1da.dev.euler
Class PE0051
- java.lang.Object
-
- net.n1da.dev.euler.core.Problem
-
- net.n1da.dev.euler.PE0051
-
- All Implemented Interfaces:
Solvable
public class PE0051 extends Problem
Solution for problem 51 "Prime digit replacements" completed on Sun, 14 Aug 2016, 18:09.- Since:
- 14.08.2016 16:34:27
- Author:
- Nico Danneberg
- See Also:
- Problem @ Project Euler, Solution @ Ni-Da-Net
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.Hashtable<java.lang.Integer,java.util.ArrayList<LargeNumber>>
mem
Internal memory for all primes referenced by their length
-
Method Summary
-
Methods inherited from class net.n1da.dev.euler.core.Problem
finish, getResult, getRuntime, toString
-
-
-
-
Field Detail
-
mem
private java.util.Hashtable<java.lang.Integer,java.util.ArrayList<LargeNumber>> mem
Internal memory for all primes referenced by their length
-
-
Method Detail
-
prepare
public void prepare()
Prepares this problem by loading thememory
with primes between 100 and 1.000.000 sorted by their number of digits.
-
solve
public java.lang.String solve()
This method solves the problem by replacing every digit in a prime searching for other primes in this way.- Returns:
- the first prime that leads to a eight prime long series
-
-