HOW IT IS CALCULATED
Check whether an integer is prime
UtilityLake checks whether the integer has any divisor other than 1 and itself.
Instant resultClear formulaRuns locally
01Values
02test divisors up to √n
03Result
97 → prime
You only need to test divisors up to the square root
If a larger divisor exists, it must be paired with a smaller divisor that would already have been found.
02
In short
What logic does the calculator use?
test divisors up to √n
Example?
97 → prime