Package net.n1da.dev.euler
Class PE0047
- java.lang.Object
-
- net.n1da.dev.euler.core.Problem
-
- net.n1da.dev.euler.PE0047
-
- All Implemented Interfaces:
Solvable
public class PE0047 extends Problem
Solution for problem 47 "Distinct primes factors" completed on Sun, 29 May 2016, 10:44.- Since:
- 29.05.2016 07:48:17
- Author:
- Nico Danneberg
- See Also:
- Problem @ Project Euler, Solution @ Ni-Da-Net
-
-
Method Summary
-
Methods inherited from class net.n1da.dev.euler.core.Problem
finish, getResult, getRuntime, toString
-
-
-
-
Method Detail
-
prepare
public void prepare()
-
solve
public java.lang.String solve()
This method solves the given problem by checking every number to have four distinct prime factors. If four of these numbers are found consecutive the first of them is returned.- Returns:
- the first of four consecutive numbers with four distinct prime factors
- See Also:
Mathe.getPrimeFactors(long)
-
-