**Problem:**

It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.

Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.

Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.

**Solution:**

4613732

**Code:**

The solution may include methods that will be found here: Library.java .

The solution may include methods that will be found here: Library.java .

public interface EulerSolution{

public String run();

}

/*

* Solution to Project Euler problem 2

* By Nayuki Minase

*

* http://nayuki.eigenstate.org/page/project-euler-solutions

* https://github.com/nayuki/Project-Euler-solutions

*/

public final class p002 implements EulerSolution {

public static void main(String[] args) {

System.out.println(new p002().run());

}

public String run() {

int sum = 0;

for (int i = 0; ; i++) {

int fib = fibonacci(i);

if (fib > 4000000)

break;

if (fib % 2 == 0)

sum += fib;

}

return Integer.toString(sum);

}

private static int fibonacci(int x) {

if (x < 0 || x > 46)

throw new IllegalArgumentException();

int a = 0;

int b = 1;

for (int i = 0; i < x; i++) {

int c = a + b;

a = b;

b = c;

}

return a;

}

}

## No comments :

## Post a Comment