Package net.n1da.dev.euler

Class PE0046

java.lang.Object

net.n1da.dev.euler.core.Problem

net.n1da.dev.euler.PE0046

All Implemented Interfaces:

Solvable

public class PE0046
extends Problem

Solution for problem 46 "Goldbach's other conjecture" completed on Sun, 29 May 2016, 07:28.

Since:

22.05.2016 14:23:46

Author:

Nico Danneberg

See Also:

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

Field Summary

Fields

Modifier and Type	Field	Description
private java.util.ArrayList<java.lang.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	Description
PE0046()	A simple constructor to set number and title.

Method Summary

Modifier and Type	Method	Description
void	prepare()	It initializes the list of primes with values less than 1.000.000 using the Sieve class.
java.lang.String	solve()	It solves the problem by checking every odd beginning with 3 if: it is no prime there is a prime when a double square is subtracted It stops execution when an odd is found where both condition do not match.

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 java.util.ArrayList<java.lang.Integer> primes

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

Constructor Detail

PE0046

public PE0046()

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 java.lang.String solve()

It solves the problem by checking every odd beginning with 3 if:

1. it is no prime
2. there is a prime when a double square is subtracted

It stops execution when an odd is found where both condition do not match.

Returns:

the first found odd that does not match the both conditions