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

Field Summary

Fields

Modifier and Type	Field and Description
private ArrayList<Integer>	primes Storage for all primes that can occur less than one million.

Fields inherited from class net.n1da.dev.euler.core.Problem

number, title

Constructor Summary

Constructors

Constructor and Description
PE0047() A simple constructor to set number and title.

Method Summary

Modifier and Type	Method and Description
void	prepare() It initializes the list of primes with values less than 1.000.000 using the Sieve class.
String	solve() This method solves the given problem by checking every number to have four distinct prime factors.

Methods inherited from class net.n1da.dev.euler.core.Problem

finish, getResult, getRuntime, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

primes

private ArrayList<Integer> primes

Storage for all primes that can occur less than one million.

Constructor Detail

PE0047

public PE0047()

A simple constructor to set number and title.

Method Detail

prepare

public void prepare()

It initializes the list of primes with values less than 1.000.000 using the Sieve class.

Specified by:

prepare in interface Solvable

Overrides:

prepare in class Problem

See Also:

Sieve

solve

public 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)