<pre class="shiki github-dark shaku"><code>/** * @param {number} num - positive integer */function isPrime(num) { const divider = Math.trunc(Math.sqrt(num)); if(num==1)return false; if(num==3 || num==2) return true; let counter = 2; let result = true; while(counter&lt;=divider) { if(num%counter!==0) { counter++; continue } if(num%counter===0){ result=false; break } } return result}</code></pre>

Math is queen

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…