Question

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

Answer 1

function isPrime($n) {
    if ($n == 0 || $n == 1) {
        return false;
    }
    
    for ($i = 2; $i <= sqrt($n); $i++) {
        if ($n % $i == 0) {
               return false;
        }
    }
        
    return true;
}
    
function findConsecutivePrimeSumEqualTo($n) {
    $sum = 0;
    
    for ($i = 2; $i < $n; $i++) {
        if (isPrime($i)) {
            echo $i . " ";
            $sum += $i;
            if ($sum == $n) {
                break;
            }
            if ($sum > $n) {
                echo "Not Found" . "\n";
                break;
            }
        }
    }
}

findConsecutivePrimeSumEqualTo(41);




/*
run:

2 3 5 7 11 13 

*/

 

70+ SQL courses for beginners and professionals