Java Program to Check Whether a Number can be Expressed as Sum of Two Prime Numbers

In this program, you’ll learn to check whether a given number can be expressed as a sum of two prime numbers or not. This is done with the help of loops and break statements in Java.

To accomplish this task, checkPrime() function is created.

The checkPrime() returns 1 if the number passed to the function is a prime number.

Example: Integer as a Sum of Two Prime Numbers

  1. public class CheckPrime {
  3. public static void main(String[] args) {
  4. int number = 34;
  5. boolean flag = false;
  6. for (int i = 2; i <= number / 2; ++i) {
  8. // condition for i to be a prime number
  9. if (checkPrime(i)) {
  11. // condition for n-i to be a prime number
  12. if (checkPrime(number - i)) {
  14. // n = primeNumber1 + primeNumber2
  15. System.out.printf("%d = %d + %d\n", number, i, number - i);
  16. flag = true;
  17. }
  19. }
  20. }
  22. if (!flag)
  23. System.out.println(number + " cannot be expressed as the sum of two prime numbers.");
  24. }
  26. // Function to check prime number
  27. static boolean checkPrime(int num) {
  28. boolean isPrime = true;
  30. for (int i = 2; i <= num / 2; ++i) {
  31. if (num % i == 0) {
  32. isPrime = false;
  33. break;
  34. }
  35. }
  37. return isPrime;
  38. }
  39. }

When you run the program, the output will be:

34 = 3 + 31
34 = 5 + 29
34 = 11 + 23
34 = 17 + 17