Project Euler > Problem 51 > Prime digit replacements (Java Solution)

Problem:

By replacing the 1st digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.

By replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.

Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family.

Solution:

233168

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

public interface EulerSolution{

public String run();

}

/* 
 * Solution to Project Euler problem 1
 * By Nayuki Minase
 * 
 * http://nayuki.eigenstate.org/page/project-euler-solutions
 * https://github.com/nayuki/Project-Euler-solutions
 */


public final class p001 implements EulerSolution {
 
 public static void main(String[] args) {
  System.out.println(new p001().run());
 }
 
 
 public String run() {
  int sum = 0;
  for (int i = 0; i < 1000; i++) {
   if (i % 3 == 0 || i % 5 == 0)
    sum += i;
  }
  return Integer.toString(sum);
 }
 
}