Enter a positive integer and find out if it is prime or composite. Type "iterations" to find out the status of all the numbers from one to n, where n is the number you inputted.
This primality test first takes in an input. Then, it square roots the input and rounds it. If any of the primes under the rounded root can divide evenly into the input, then it should be composite. Example: input = 10 The square root of 10 is ~ 3.16. Round it and get 3. 10 can be divided evenly by 2, meaning that 10 is composite. Example: input = 23 The square root of 23 is ~ 4.79. Round it and get 5. 23 cannot be rounded by 2 or 3, meaning that 23 is prime.
