PHP determines whether it is a prime number

Determine whether it is a prime number. A prime number can be divisible by 1 and itself

<code><span><span>function</span><span>checknumber</span><span>(<span>$number</span>)</span>{</span><span>for</span>(<span>$i</span>=<span>2</span>;<span>$i</span><=sqrt(<span>$number</span>);<span>$i</span>++){
      <span>if</span>(<span>$number</span>%<span>$i</span>==<span>0</span>){
       <span>return</span><span>0</span>;
     }
   <span>return</span><span>1</span>;
}

 }</code>

').addClass('pre-numbering').hide(); $(this).addClass('has-numbering').parent().append($numbering); for (i = 1; i ').text(i)); }; $numbering.fadeIn(1700); }); });

The above has introduced how to determine whether a prime number is a prime number in PHP, including aspects of it. I hope it will be helpful to friends who are interested in PHP tutorials.