Function to count prime triplets having sum of the first two elements equal to the third element
function primeTriplet ( N ) { prime [ 0 ] = false ; prime [ 1 ] = false ; for ( let i = 2 ; i * i <= N ; i ++ ) { if ( prime [ i ] ) { for ( let j = i * i ; j <= N ; j += i ) { prime [ j ] = false ; } } } for ( let i = 3 ; i <= N ; i ++ ) {