Package net.n1da.dev.euler

Class PE0044

java.lang.Object

net.n1da.dev.euler.core.Problem

net.n1da.dev.euler.PE0044

All Implemented Interfaces:

Solvable

public class PE0044
extends Problem

Solution for problem 44 "Pentagon numbers" completed on Fri, 20 May 2016, 19:33.

Since:

20.05.2016 16:04:21

Author:

Nico Danneberg

See Also:

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

Field Summary

Fields

Modifier and Type	Field	Description
(package private) java.util.ArrayList<java.lang.Long>	pentagons	A storage for all found pentagon numbers.

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

number, title

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method	Description
void	prepare()	It just initializes the pentagons list.
java.lang.String	solve()	This method solves the given problem by calculating one pentagon number after each other.

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

pentagons

java.util.ArrayList<java.lang.Long> pentagons

A storage for all found pentagon numbers.

Constructor Detail

PE0044

public PE0044()

A simple constructor to set number and title.

Method Detail

prepare

public void prepare()

It just initializes the pentagons list.

Specified by:

prepare in interface Solvable

Overrides:

prepare in class Problem

solve

public java.lang.String solve()

This method solves the given problem by calculating one pentagon number after each other. Every number is tested with all other found numbers. If the sum AND the difference of two pentagon number is another one the difference is stored. A loop runs until the difference of two consecutive is larger than the minimum found difference.

Returns:

the smallest difference of two pentagon numbers that is a pentagon number, two