Question

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

Answer 1

function isPrime(n: number) {
    if (n == 0 || n == 1) {
        return false;
    }
    
    for (let i: number = 2; i <= Math.sqrt(n); i++) {
        if (n % i == 0) {
            return false;
        }
    }
    
    return true;
}

function findConsecutivePrimeSumEqualTo(n: number) {
    let sum: number = 0;
    
    for (let i: number = 2; i < n; i++) {
        if (isPrime(i)) { 
            console.log(i);
            sum += i;
            if (sum == n) {
                break;
            }
            if (sum > n) {
                console.log("Not Found");
                break;
            }
        }
    }
}

findConsecutivePrimeSumEqualTo(77);

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

*/

 

70+ SQL courses for beginners and professionals