Question

How to find the consecutive prime numbers which sum of them equal to N in Java

Answer 1

public class MyClass {
    private static boolean isPrime(int n) {
    	if (n == 0 || n == 1) {
    		return false;
    	}

    	for (int i = 2; i <= Math.sqrt(n); i++) {
    		if (n % i == 0) {
    			return false;
    		}
    	}
    
    	return true;
    }

    private static void findConsecutivePrimeSumEqualTo(int n) {
    	int sum = 0;
    	
    	for (int i = 2; i < n; i++)	{
    		 if (isPrime(i)) {
    			System.out.print(i + " ");
    			sum += i;
    			if (sum == n) {
    				break;
    			}
    			if (sum > n) {
    				System.out.println("Not Found");
    				break;
    			}
    		 }
    	}
    }
    
    public static void main(String args[]) {
        findConsecutivePrimeSumEqualTo(41);
    }
}






/*
run:
   
2 3 5 7 11 13 
   
*/

 

70+ SQL courses for beginners and professionals