Package net.n1da.dev.euler

Class PE0003

java.lang.Object

net.n1da.dev.euler.core.Problem

net.n1da.dev.euler.PE0003

All Implemented Interfaces:

Solvable

public class PE0003
extends Problem

Solution for problem 3 "Largest prime factor" completed on Tue, 8 Apr 2015, 00:23.

Since:

07.04.2015 23:41:36

Author:

Nico Danneberg

See Also:

Problem @ Project Euler, Solution @ Ni-Da-Net

Field Summary

Fields

Modifier and Type	Field	Description
private long	num	The given maximum number.
private Sieve	sieve	The storage for the "Sieve of Eratosthenes".
private int	sqrtNum	The square root of the given number

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

number, title

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method	Description
void	prepare()	Initializes the sieve with the maximum of sqrtNum.
java.lang.String	solve()	Runs the algorithm of the "Sieve of Eratosthenes" and finally finds the largest prime factor.

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

num

private long num

The given maximum number.

sqrtNum

private int sqrtNum

The square root of the given number

sieve

private Sieve sieve

The storage for the "Sieve of Eratosthenes".

See Also:

Sieve

Constructor Detail

PE0003

public PE0003()

A simple constructor to set number and title.

Method Detail

prepare

public void prepare()

Initializes the sieve with the maximum of sqrtNum.

Specified by:

prepare in interface Solvable

Overrides:

prepare in class Problem

See Also:

Sieve(int)

solve

public java.lang.String solve()

Runs the algorithm of the "Sieve of Eratosthenes" and finally finds the largest prime factor.

Returns:

the largest prime factor

See Also:

Sieve.next(), Sieve of Eratosthenes @ Wikipedia