<pre class="shiki github-dark shaku"><code>/** * @param {number} num - positive integer */function isPrime(num) { if(num === 1) return false if(num === 2) return true for(let i=2; i&lt;num ;i++){ if(num%i === 0) { return false } } return true}</code></pre>

Solution

A Prime number is a natural number greater than 1 that is divisible only by itself and 1, such as 2,3,5.... You are asked to implement isPrime() to ch…