### Question:
NumberAlgorithm { public static List<Integer> getPrimeNumbers(int start, int end) { List<Integer> primeNumbers = new ArrayList<>(); for (; start < end; start++) { if (start == 1 || start == 2) continue; int j = 2; boolean divisible = false; while (j < start) { if (start % j == 0) { divisible = true; break; } j++; } if (!divisible) primeNumbers.add(start); } return primeNumbers; }  static List<Integer> getPrimeNumbers(int start, int end); static Integer getPrimeNumberSum(int start, int end); static void output(int[][] num, int start, int end);  }### Answer:
@Test public void testGetPrimeNumbers() { List<Integer> primeNumbers = NumberAlgorithm.getPrimeNumbers(1, 1000); for (Integer primeNumber : primeNumbers) { System.out.println(primeNumber); } }