Question 913107
A simple method is to divide your integer n by every prime from 2 up to *[tex \large \lfloor \sqrt{n} \rfloor], and if your quotient is an integer for some divisor, n is not prime. If you do obtain an integer quotient, stop. (because you know n is composite)