Since a number cannot be divided by any no greater than its half other then itself so dividing by two decreases the no comparisons.
If a number n is not a prime, it can be factored into two factors a and b:
n = ab
If both a and b were greater than the square root of n, ab would be greater than n. So at least one of those factors must be less or equal to the square root of n, and to check if n is prime, we only need to test for factors less than or equal to the square root.
let me give you a complete programme. Correct some mistakes as this comment box don’t allow some syntax. Hope this will help you!
#include< iostream.h>
#include< conio.h>
main()